A simple constraint qualification in convex programming

DOI10.1007/BF01582159zbMath0805.90086OpenAlexW2079397308MaRDI QIDQ1315427

V. Pereyra

Publication date: 27 March 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582159

zbMATH Keywords

constraint qualificationmultiobjective programsdifferentiable convex functionsKarush-Kuhn- Tucker conditionset of strong Pareto optima

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29)

Related Items

A saddle-point characterization of Pareto optima, Stable parametric programming^*, Partly convex programming and Zermelo's navigation problems, LFS functions in multi-objective programming, A new algorithm for generalized fractional programs

Cites Work

• Unnamed Item
• Unnamed Item
• Proper efficiency and the theory of vector maximization
• Geometry of optimality conditions and constraint qualifications: The convex case
• Asymptotic Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space