Optimality conditions for minimization over the (weakly or properly) efficient set
The paper considers the minimization problem of a nonlinear real-valued function over the (weak or properly) efficient set associated to a convex, multiple objective programming problem (MOP) in Banach spaces. Such problem was studied initially by Philip in 1972. The main difficulties in approaching the problem are created by the nonexplicit form of the efficient set, and the fact that, even in the linear case, the problem is not convex. It is very interesting that the author gives optimality conditions for the problem via derivatives for set-valued functions using some results of Corley (1988). Moreover, it is valuable that these general optimality conditions are applied to the following two finite-dimensional cases: (i) all functions of the MOP are linear; (ii) all constraint functions of the MOP are convex and multi-objective function is strictly convex.
- An exact penalty on bilevel programs with linear vector optimization lower level
- Second-order efficiency conditions and sensitivity of efficient points
- Necessary conditions for nonlinear suboptimization over the weakly- efficient set
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case
- Post-Pareto analysis and a new algorithm for the optimal parameter tuning of the elastic net
- Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case
- Semivectorial bilevel optimization problem: penalty approach
- Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Semivectorial bilevel programming versus scalar bilevel programming
- Optimality conditions for semivectorial bilevel convex optimal control problems
- On minimization over weakly efficient sets
- Optimization over the efficient set
- Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
- Optimization over the efficient set of multi-objective convex optimal control problems
- Existence results and optimization over the set of efficient solutions in vector-valued approximation theory
- Optimization over the Pareto front of nonconvex multi-objective optimal control problems
- Notes on the value function approach to multiobjective bilevel optimization
- Minimization of a quasi-concave function over an efficient set
- Semivectorial bilevel optimization on Riemannian manifolds
This page was built for publication: Optimality conditions for minimization over the (weakly or properly) efficient set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367607)
