Saddle points and Pareto points in multiple objective programming
From MaRDI portal
Publication:2569145
DOI10.1007/s10898-004-5902-6zbMath1119.90047OpenAlexW1989227105MaRDI QIDQ2569145
Matthias Ehrgott, Margaret M. Wiecek
Publication date: 18 October 2005
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-4737
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)
Related Items (6)
Charnes-Cooper scalarization and convex vector optimization ⋮ Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming ⋮ Saddle point and exact penalty representation for generalized proximal Lagrangians ⋮ Characterizing strict efficiency for convex multiobjective programming problems ⋮ Two Types of Approximate Saddle Points ⋮ Saddle points for vector valued functions: existence, necessary and sufficient theorems
Cites Work
- Unnamed Item
- Vector optimization and generalized Lagrangian duality
- A saddle-point characterization of Pareto optima
- Equivalence of balance points and Pareto solutions in multiple-objective programming
- Efficiency and solution approaches to bicriteria nonconvex programs
- Approximate saddle-point theorems in vector optimization
- Duality in nonlinear multiobjective programming using augmented Lagrangian functions
- Proper efficiency and the theory of vector maximization
- Piecewise quadratic approximation of the non-dominated set for bi-criteria programs
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- A general saddle point result for constrained optimization
- e-weak minimal solutions of vector optimization problems with set-valued maps
- Duality and exact penalization for vector optimization via augmented Lagrangian
This page was built for publication: Saddle points and Pareto points in multiple objective programming
