Duality for vector optimization of set-valued functions

DOI10.1006/jmaa.1996.0251zbMath0851.90110OpenAlexW1993458641MaRDI QIDQ1919589

Song Wen

Publication date: 25 September 1996

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

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

zbMATH Keywords

set-valued functionsoptimality conditionslocally convex spacescone separation theoremduality for vector optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)

Related Items (14)

Strong duality for proper efficiency in vector optimization ⋮ Conjugate Maps, Subgradients and Conjugate Duality in Set-Valued Optimization ⋮ Conjugate duality in set-valued vector optimization ⋮ Approximate Lagrangian duality and saddle point optimality in set optimization ⋮ Duality for set-valued multiobjective optimization problems. I: Mathematical programming ⋮ On dual vector optimization and shadow prices ⋮ Lagrangian duality in set-valued optimization ⋮ \( \varepsilon \)-properly efficiency of multiobjective semidefinite programming with set-valued functions ⋮ Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior ⋮ Set Optimization—A Rather Short Introduction ⋮ Image space analysis and scalarization of multivalued optimization ⋮ Second-order composed contingent derivatives of perturbation maps in set-valued optimization ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps ⋮ The optimality conditions for vector optimization of set-valued maps

This page was built for publication: Duality for vector optimization of set-valued functions