Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
From MaRDI portal
Publication:1378563
DOI10.1006/jmaa.1997.5568zbMath0893.90150OpenAlexW2069454877MaRDI QIDQ1378563
Publication date: 11 March 1998
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1997.5568
alternative theoremduality theoremsgeneralized inequality-equality systemsvector optimization of set-valued maps
Related Items (35)
Approximate weakly efficient solutions of set-valued vector equilibrium problems ⋮ Optimality conditions for vector optimisation with set-valued maps ⋮ Proximal Proper Saddle Points in Set-Valued Optimization ⋮ Strict efficiency in vector optimization with nearly convexlike set-valued maps ⋮ Necessary conditions for efficient solution of vector optimization problems ⋮ Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps ⋮ Strong Lagrange duality and the maximum principle for nonlinear discrete time optimal control problems ⋮ Approximate Lagrangian duality and saddle point optimality in set optimization ⋮ Lower semicontinuity of the solution mapping to a parametric generalized vector equilibrium problem ⋮ Superefficiency in vector optimization with nearly subconvexlike set-valued maps ⋮ On first order optimality conditions for vector optimization ⋮ Lagrangian duality in set-valued optimization ⋮ Semicontinuity of approximate solution mappings for parametric generalized weak vector equilibrium problems ⋮ Optimality and duality in set-valued optimization utilizing limit sets ⋮ Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces ⋮ SOME PROPERTIES OF OPTIMAL MULTIFUNCTIONS IN PARAMETRIC MULTIOBJECTIVE OPTIMIZATION WITH SET-VALUED MAPS ⋮ A note on quasiconvex set-valued maps. ⋮ Upper and lower semicontinuity for set-valued mappings involving constraints ⋮ e-weak minimal solutions of vector optimization problems with set-valued maps ⋮ Lagrange duality, stability and subdifferentials in vector optimization ⋮ Erratum for ``Higher-order weakly generalized adjacent epiderivatives and applications to duality of set-valued optimization ⋮ Topological properties of Henig globally efficient solutions of set-valued problems ⋮ Characterizations of solutions for vector equilibrium problems ⋮ Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior ⋮ Lagrangian duality for multiobjective programming problems in lexicographic order ⋮ Higher-order optimality conditions and duality for approximate solutions in non-convex set-valued optimization ⋮ Existence of a solution and variational principles for vector equilibrium problems ⋮ Set Optimization—A Rather Short Introduction ⋮ Lagrangian multipliers for generalized affine and generalized convex vector optimization problems of set-valued maps ⋮ Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems ⋮ E-Benson proper efficiency in vector optimization ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps ⋮ Super efficiency in vector optimization with nearly convexlike set-valued maps. ⋮ Near-subconvexlikeness in vector optimization with set-valued functions ⋮ A new approach to constrained optimization via image space analysis
Cites Work
- Existence and Lagrangian duality for maximization of set-valued functions
- Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems
- Optimization of set-valued functions
- Lagrange multipliers and saddle points in multiobjective programming
- Invex optimisation problems
- Optimality conditions for maximizations of set-valued functions
- Unnamed Item
- Unnamed Item
This page was built for publication: Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
