Converse duality in nonlinear programming with cone constraints

DOI10.1016/j.ejor.2004.05.028zbMath1085.90057OpenAlexW2021999875MaRDI QIDQ2572241

Xiao Qi Yang, Kok Lay Teo, Yang, Xinmin

Publication date: 16 November 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.05.028

zbMATH Keywords

Nonlinear programmingConverse dualityPositive definitenessPseudo-invexity

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (5)

Second-order symmetric duality in vector optimization involving \((K,\eta)\)-pseudobonvexity ⋮ Second order duality for multiobjective programming with cone constraints ⋮ Second-order symmetric duality for multiple objectives nonlinear programming under generalizations of cone-preinvexity functions ⋮ Multiobjective nonlinear second order symmetric duality with \((K,F)\)-pseudoconvexity ⋮ Higher-order symmetric duality in vector optimization problem involving generalized cone-invex functions

Cites Work

• Unnamed Item
• Unnamed Item
• Pseudo-invexity and duality in nonlinear programming
• A note on pseudo-invexity and duality in nonlinear programming
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Further Generalizations of Convexity in Mathematical Programming
• On Symmetric Duality in Nonlinear Programming

This page was built for publication: Converse duality in nonlinear programming with cone constraints