Optimality conditions for metrically consistent approximate solutions in vector optimization
From MaRDI portal
Publication:2471086
DOI10.1007/s10957-007-9191-3zbMath1171.90010OpenAlexW1997655709MaRDI QIDQ2471086
Vicente Novo Sanjurjo, Bienvenido Jiménez, César Gutiérrez
Publication date: 18 February 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-007-9191-3
optimality conditionsscalarizationVector optimization\(\epsilon\)-efficiencyGauge functionalsgeneralized Chebyshev norms
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
A combined scalarizing method for multiobjective programming problems ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ Characterizing ϵ-properly efficient solutions ⋮ On approximating weakly/properly efficient solutions in multi-objective programming ⋮ A generic approach to approximate efficiency and applications to vector optimization with set-valued maps ⋮ An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems ⋮ Approximate solutions of multiobjective optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonconvex separation theorems and some applications in vector optimization
- On approximate solutions in vector optimization problems via scalarization
- \(\epsilon\)-solutions in vector minimization problems
- Theory of multiobjective optimization
- Epsilon efficiency
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- New closedness results for efficient sets in multiple objective mathematical programming
- Stability results for approximately efficient solutions
- On several concepts for \(\varepsilon\)-efficiency
- Variational methods in partially ordered spaces
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- Approximate saddle-point theorems in vector optimization
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- On variational principles, level sets, well-posedness, and \(\epsilon\)-solutions in vector optimization
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- Vector optimization. Set-valued and variational analysis.
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- ε-approximate solutions in multiobjective optimization
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
This page was built for publication: Optimality conditions for metrically consistent approximate solutions in vector optimization
