Lagrange multipliers and saddle points in multiobjective programming
From MaRDI portal
Publication:1337207
DOI10.1007/BF02191762zbMath0823.90107OpenAlexW2001348424MaRDI QIDQ1337207
Publication date: 4 December 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02191762
Related Items (35)
Duality and saddle-points for convex-like vector optimization problems on real linear spaces ⋮ Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems ⋮ Higher Order Efficiency, Saddle Point Optimality, and Duality for Vector Optimization Problems ⋮ Global efficiency in multiobjective programming* ⋮ Nearly subconvexlike set-valued maps and vector optimization problems ⋮ Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps ⋮ Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces ⋮ Generalized Lagrange function and generalized weak saddle points for a class of multiobjective fractional optimal control problems ⋮ Some saddle-point theorems for vector-valued functions ⋮ Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method ⋮ Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness. ⋮ Two Types of Approximate Saddle Points ⋮ Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Lower semicontinuity of the solution mapping to a parametric generalized vector equilibrium problem ⋮ Efficient and weak efficient points in vector optimization with generalized cone convexity ⋮ Conic separation for vector optimization problems ⋮ Moreau-Rockafellar theorems for nonconvex set-valued maps ⋮ Lagrangian duality and cone convexlike functions ⋮ Optimality and mixed saddle point criteria in multiobjective optimization ⋮ Proper efficiency in vector optimization on real linear spaces. ⋮ Lagrangian duality for multiobjective programming problems in lexicographic order ⋮ Second order modified objective function method for twice differentiable vector optimization problems over cone constraints ⋮ About a gap between multiobjective optimization and scalar optimization ⋮ New generalized convexity notion for set-valued maps and application to vector optimization ⋮ Sequential optimality conditions for multiobjective fractional programming problems ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality ⋮ Characterizations of the Benson proper efficiency for nonconvex vector optimization ⋮ Lagrangian multipliers for generalized affine and generalized convex vector optimization problems of set-valued maps ⋮ Benson proper efficiency in the vector optimization of set-valued maps ⋮ Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems ⋮ Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints ⋮ Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions ⋮ ε-approximate solutions in multiobjective optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric consideration of duality in vector optimization
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Theory of multiobjective optimization
- Existence and Lagrangian duality for maximization of set-valued functions
- Some minimax problems of vector-valued functions
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Proper efficiency with respect to cones
- A characterization of generalized saddle points for vector-valued functions via scalarization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- On duality for weakly minimized vector valued optimization problems
- Weak minimization and duality
- Quasimin and quasisaddlepoint for vector optimization
This page was built for publication: Lagrange multipliers and saddle points in multiobjective programming
