Saddle Points and Pareto Points in Multiple Objective Programming

  title={Saddle Points and Pareto Points in Multiple Objective Programming},
  author={Matthias Ehrgott and Margaret M. Wiecek},
  journal={Journal of Global Optimization},
In this paper relationships between Pareto points and saddle points are studied in convex and nonconvex multiple objective programming. The analysis is based on partitioning the index sets of objectives and constraints and splitting the original problem into subproblems having a special structure. The results are based on scalarizations of multiple objective programs and related linear and augmented Lagrangian functions. In the nonconvex case, a saddle point characterization of Pareto points is… 

E-Saddle Point Criteria for E-differentiable Vector Optimization Problems with Inequality and Equality Constraints

The so-called E-saddle point criteria are established for such (not necessarily) differentiable multiobjective programming problems with E-differentiable E-convex functions.

Multiobjective Convex Optimization in Real Banach Space

Saddle point necessary and sufficient Pareto optimality conditions for considered problems under some constraint qualifications are established and Karush–Kuhn–Tucker optimality Conditions for the differentiable cases are established.

Characterizing strict efficiency for convex multiobjective programming problems

The article pertains to characterize strict local efficient solution of higher order for the multiobjective programming problem (MOP) with inequality constraints to derive the necessary and sufficient optimality conditions for s.s.l.e. of order $${m \geqq 1}$$ for the convex MOP.

Saddle Points Theory of Two Classes of Augmented Lagrangians and Its Applications to Generalized Semi-infinite Programming

In this paper, we develop the sufficient conditions for the existence of local and global saddle points of two classes of augmented Lagrangian functions for nonconvex optimization problem with both

An approximation algorithm for convex multi-objective programming problems

This work proposes a method for approximating the nondominated set of a multi-objective nonlinear programming problem, where the objective functions and the feasible set are convex, and proves that this method provides a set of weakly ε-nondominated points.

Saddle point and exact penalty representation for generalized proximal Lagrangians

A generalized proximal Lagrangian function is introduced for the constrained nonlinear programming problem and existence of its saddle points are discussed, establishing equivalent relationship between global saddle points and exact penalty representations.

Generation of efficient and ε-efficient solutions in multiple objective linear programming

We develop an algorithm to solve a multiple objective linear programming problem with bounded variables. It is based on the scalarization theorem of optimal solutions of multiobjective linear

A Note on Robustness of the Min-Max Solution to Multiobjective Linear Programs

The challenge of the use of scalarizing methods in multiobjective optimization results from the choice of the method, which may not be apparent, and given that a method has been selected, from the

Two Types of Approximate Saddle Points

In this paper, we study two types of approximate solutions for a vector optimization problem in Banach space setting. Our main concern is to define two new concepts of approximate saddle points and



A saddle-point characterization of Pareto optima

This paper provides an answer to the following basic problem of convex multi-objective optimization: Find a saddle-point condition that is both necessary and sufficient that a given point be Pareto

LFS functions in multi-objective programming

We find conditions, in multi-objective convex programming with nonsmooth functions, when the sets of efficient (Pareto) and properly efficient solutions coincide. This occurs, in particular, when all

Duality and Exact Penalization for Vector Optimization via Augmented Lagrangian

An augmented Lagrangian function for a multiobjective optimization problem with an extended vector-valued function is introduced and set-valued dual maps and dual optimization problems are constructed.

Piecewise quadratic approximation of the non-dominated set for bi-criteria programs

A procedure to approximate the non-dominated set for general (continuous) bi-criteria programs is proposed. The piecewise approximation is composed of quadratic curves, each of which is developed

Approximate saddle-point theorems in vector optimization

The paper contains definitions of different types of nondominated approximate solutions to vector optimization problems and gives some of their elementary properties. Then, saddle-point theorems

Approximate Saddle Point Assertions for a General Class of Approximation Problems

Using a generalized Lagrangean, a vector-valued approximation problem, where the objective function is defined by sub inear mappings f : X → R p is considered, necessary and sufficient conditions for approximate saddle points of this Lagrangeans are derived.

Efficiency and Solution Approaches to Bicriteria Nonconvex Programs

The new concepts, qi-approachable points and augmented duality gap, are introduced in order to determine the location of nondominated solutions with respect to aduality gap as well as the connectedness of the nondominated set.

A general saddle point result for constrained optimization

A saddle point theory in terms of extended Lagrangian functions is presented for nonconvex programs. The results parallel those for convex programs conjoined with the usual Lagrangian formulation.

Nonlinear Programming: Theory and Algorithms

The book is a solid reference for professionals as well as a useful text for students in the fields of operations research, management science, industrial engineering, applied mathematics, and also in engineering disciplines that deal with analytical optimization techniques.

Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming

If a nonlinear programming problem is analyzed in terms of its ordinary Lagrangian function, there is usually a duality gap, unless the objective and constraint functions are convex. It is shown he...