Optimality conditions for vector optimisation with set-valued maps

DOI10.1017/S0004972700040168zbMath1173.90532MaRDI QIDQ4804626

Yong-Wei Huang

Publication date: 2002

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

set-valued mapsoptimality conditionsFarkas-Minkowski alternative theoremweak E-minimisers

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Ordered topological linear spaces, vector lattices (46A40)

Related Items (5)

Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities ⋮ Moreau-Rockafellar theorems for nonconvex set-valued maps ⋮ New generalized convexity notion for set-valued maps and application to vector optimization ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems

Cites Work

• Unnamed Item
• A theorem of the alternative and its application to the optimization of set-valued maps
• Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
• Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
• Lagrangian duality for minimization of nonconvex multifunctions
• General Ekeland's variational principle for set-valued mappings.
• e-weak minimal solutions of vector optimization problems with set-valued maps
• Continuous accumulation games in continuous regions

This page was built for publication: Optimality conditions for vector optimisation with set-valued maps