Lagrangian duality for vector optimization problem with set-valued mappings

DOI10.11650/TJM.17.2013.2896zbMath1290.90067OpenAlexW4243977694MaRDI QIDQ1949036

Xian-Jun Long, Jian-Wen Peng

Publication date: 25 April 2013

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: http://journal.taiwanmathsoc.org.tw/index.php/TJM/article/view/1935

zbMATH Keywords

alternative theoremLagrangian dualitynearly cone-subconvexlikenessE-weak minimizerset-valued vector optimization problems

Mathematics Subject Classification ID

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

Related Items (5)

Generic stability of the solution mapping for set-valued optimization problems ⋮ Approximate Lagrangian duality and saddle point optimality in set optimization ⋮ Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications ⋮ Optimality and duality in set-valued optimization utilizing limit sets ⋮ Approximate solutions for nonconvex set-valued optimization and vector variational inequality

This page was built for publication: Lagrangian duality for vector optimization problem with set-valued mappings