On cone characterizations of strong and Lexicographic optimality in convex multiobjective optimization

DOI10.1007/s10957-009-9570-zzbMath1184.90156OpenAlexW2038829940MaRDI QIDQ846939

Yury Nikulin, Marko M. Mäkelä

Publication date: 15 February 2010

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

Full work available at URL: https://doi.org/10.1007/s10957-009-9570-z

zbMATH Keywords

normal conetangent conecontingent conestrong efficiency

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items (8)

Strongly proper efficient solutions: efficient solutions with bounded trade-offs ⋮ Lexicographic multi-objective MPC for constrained nonlinear systems with changing objective prioritization ⋮ On the transformation of lexicographic nonlinear multiobjective programs to single objective programs ⋮ Various types of well-posedness for vector equilibrium problems with respect to the lexicographic order ⋮ On penalty method for equilibrium problems in lexicographic order ⋮ Lagrangian duality for multiobjective programming problems in lexicographic order ⋮ Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order ⋮ Tykhonov well-posedness for lexicographic equilibrium problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pareto optimality, game theory and equilibria
• Invexity and optimization
• Proper efficiency with respect to cones
• Nonlinear multiobjective optimization
• On cone characterizations of weak, proper and Pareto optimality in multiobjective optimization
• Efficiency conditions and duality for a class of multiobjective fractional programming problems
• Multicriteria Optimization
• Convex Analysis

This page was built for publication: On cone characterizations of strong and Lexicographic optimality in convex multiobjective optimization