Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
From MaRDI portal
Publication:1044130
DOI10.1016/j.ejor.2009.02.007zbMath1177.90406OpenAlexW2041461926MaRDI QIDQ1044130
Bienvenido Jiménez, Vicente Novo Sanjurjo, César Gutiérrez
Publication date: 10 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.02.007
vector optimizationscalarizationnecessary and sufficient optimality conditionsapproximate optimality\(\epsilon \)-efficiency
Related Items (26)
A kind of unified super efficiency via assumption (A) and applications in vector optimization ⋮ Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization ⋮ Optimality conditions for a unified vector optimization problem with not necessarily preordering relations ⋮ Approximations for Pareto and proper Pareto solutions and their KKT conditions ⋮ Characterizing ϵ-properly efficient solutions ⋮ A Brézis-Browder principle on partially ordered spaces and related ordering theorems ⋮ Stability and scalarization of weak efficient, efficient and Henig proper efficient sets using generalized quasiconvexities ⋮ On approximating weakly/properly efficient solutions in multi-objective programming ⋮ Existence of optimal points via improvement sets ⋮ Approximation of Weak Efficient Solutions in Vector Optimization ⋮ A generic approach to approximate efficiency and applications to vector optimization with set-valued maps ⋮ An interior proximal method in vector optimization ⋮ Vector optimization problems via improvement sets ⋮ \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces ⋮ Stability and scalarization in vector optimization using improvement sets ⋮ Improvement sets and vector optimization ⋮ Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior ⋮ Scalarization in set optimization with solid and nonsolid ordering cones ⋮ Nonlinear Scalarizations of Set Optimization Problems with Set Orderings ⋮ Approximate proper efficiency in vector optimization ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ A unified vector optimization problem: complete scalarizations and applications ⋮ Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency ⋮ Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization ⋮ Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization ⋮ Optimality conditions for quasi-solutions of vector optimization problems
Cites Work
- Unnamed Item
- Nonconvex separation theorems and some applications in vector optimization
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- On approximate efficiency in multiobjective programming
- On approximate solutions in vector optimization problems via scalarization
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Variational methods in partially ordered spaces
- Scalarization and stability in vector optimization
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Vector optimization. Set-valued and variational analysis.
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- Approximately Efficient Solutions in Vector Optimization
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
This page was built for publication: Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
