Lagrangian duality for multiobjective programming problems in lexicographic order

DOI10.1155/2013/573408zbMath1291.90218OpenAlexW2081620262WikidataQ58917148 ScholiaQ58917148MaRDI QIDQ2015753

Yanyan Li

Publication date: 23 June 2014

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/573408

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On lexicographic vector equilibrium problems
• On cone characterizations of strong and Lexicographic optimality in convex multiobjective optimization
• A dual-based algorithm for solving lexicographic multiple objective programs
• A minimax theorem for vector-valued functions in lexicographic order
• Theory of multiobjective optimization
• Existence and Lagrangian duality for maximization of set-valued functions
• Lagrangian function and duality theory in multiobjective programming with set functions
• Lexicographical order and duality in multiobjective programming
• Duality theory for maximizations with respect to cones
• Duality theory in multiobjective programming
• Lagrange multipliers and saddle points in multiobjective programming
• Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
• Lagrangian duality for minimization of nonconvex multifunctions
• Lagrangian duality in set-valued optimization
• Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey

This page was built for publication: Lagrangian duality for multiobjective programming problems in lexicographic order