The optimality conditions for vector optimization of set-valued maps

DOI10.1006/jmaa.1999.6426zbMath0946.90078OpenAlexW2042838607MaRDI QIDQ1305454

Zemin Li

Publication date: 30 September 1999

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1999.6426

zbMATH Keywords

vector optimizationset-valued mapsseparation theorem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (16)

Existence theorems for set optimization problems ⋮ Necessary conditions for efficient solution of vector optimization problems ⋮ Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces ⋮ \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces ⋮ Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces ⋮ Optimality conditions for a nonconvex set-valued optimization problem ⋮ Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces ⋮ Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces ⋮ A generalized alternative theorem of partial and generalized cone subconvexlike set-valued maps and its applications in linear spaces ⋮ Optimality conditions and Lagrange duality for vector extremum problems with set constraint ⋮ Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior ⋮ The relationship between two kinds of generalized convex set-valued maps in real ordered linear spaces ⋮ Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces ⋮ Set Optimization—A Rather Short Introduction ⋮ \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces ⋮ Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions.

Cites Work

• Unnamed Item
• Optimization of set-valued functions
• Duality for vector optimization of set-valued functions
• The optimality conditions of differentiable vector optimization problems
• Multivalued convexity and optimization: A unified approach to inequality and equality constraints
• Optimality conditions for maximizations of set-valued functions

This page was built for publication: The optimality conditions for vector optimization of set-valued maps