Saddle points and Pareto points in multiple objective programming
From MaRDI portal
Recommendations
- A saddle-point characterization of Pareto optima
- Saddlepoint Theory for Nondifferentiable Multiobjective Fractional Programming
- Saddle points and scalarizing sets in multiple objective linear programming
- Saddle point and generalized convex duality for multiobjective programming.
- A new method in multiple objective programming study and its application in -Pareto solution and -Pareto saddle point
Cites work
- A general saddle point result for constrained optimization
- A saddle-point characterization of Pareto optima
- Approximate saddle-point theorems in vector optimization
- Duality and exact penalization for vector optimization via augmented Lagrangian
- Duality in nonlinear multiobjective programming using augmented Lagrangian functions
- e-weak minimal solutions of vector optimization problems with set-valued maps
- Efficiency and solution approaches to bicriteria nonconvex programs
- Equivalence of balance points and Pareto solutions in multiple-objective programming
- scientific article; zbMATH DE number 440494 (Why is no real title available?)
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Piecewise quadratic approximation of the non-dominated set for bi-criteria programs
- Proper efficiency and the theory of vector maximization
- Vector optimization and generalized Lagrangian duality
Cited in
(13)- A saddle-point characterization of Pareto optima
- Equivalence of balance points and Pareto solutions in multiple-objective programming
- Saddle point and exact penalty representation for generalized proximal Lagrangians
- A new method in multiple objective programming study and its application in -Pareto solution and -Pareto saddle point
- Two Types of Approximate Saddle Points
- scientific article; zbMATH DE number 3974761 (Why is no real title available?)
- Saddle points and scalarizing sets in multiple objective linear programming
- Saddle points for vector valued functions: existence, necessary and sufficient theorems
- scientific article; zbMATH DE number 2159098 (Why is no real title available?)
- Generalized saddle points in multi-objective bilinear programming
- Characterizing strict efficiency for convex multiobjective programming problems
- Charnes-Cooper scalarization and convex vector optimization
- Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming
This page was built for publication: Saddle points and Pareto points in multiple objective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2569145)