A simple constraint qualification in convex programming
From MaRDI portal
Publication:1315427
DOI10.1007/BF01582159zbMath0805.90086OpenAlexW2079397308MaRDI QIDQ1315427
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
constraint qualificationmultiobjective programsdifferentiable convex functionsKarush-Kuhn- Tucker conditionset of strong Pareto optima
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