Non-differentiable minimax fractional programming with higher-order type I functions

DOI10.1186/1029-242X-2013-484zbMath1302.90220OpenAlexW1986435745WikidataQ59294968 ScholiaQ59294968MaRDI QIDQ2250391

Yanyan Li

Publication date: 7 July 2014

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1029-242x-2013-484

zbMATH Keywords

higher-order dual modelnon-differentiable minimax fractional programming

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)

Cites Work

• Higher-order duality for nondifferentiable minimax programming problem with generalized convexity
• An informational approach to the global optimization of expensive-to-evaluate functions
• Second order duality for minmax fractional programming
• Higher-order duality in nondifferentiable minimax programming with generalized type I functions
• Necessary conditions and sufficient conditions for static minmax problems
• On minimax fractional optimality conditions with invexity
• On minimax fractional optimality conditions with \((F,\rho)\)-convexity
• Necessary and sufficient conditions for minimax fractional programming
• On minimax fractional optimality and duality with generalized convexity
• Unified higher order duality in nondifferentiable multiobjective programming involving cones
• Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity
• Second-order duality in nondifferentiable minmax programming involving type-I functions
• Duality in nondifferentiable minimax fractional programming with generalized convexity
• Second-order duality for non-differentiable minimax fractional programming
• Duality for fractional minimax programming problems