On approximate solutions in vector optimization problems via scalarization
From MaRDI portal
Publication:861514
DOI10.1007/s10589-006-8718-0zbMath1127.90062OpenAlexW2164839060MaRDI QIDQ861514
Bienvenido Jiménez, Vicente Novo Sanjurjo, César Gutiérrez
Publication date: 29 January 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/177639
approximate solutiongauge functionalparametric representationmonotone functional\(\varepsilon\)-efficiency
Related Items (25)
A combined scalarizing method for multiobjective programming problems ⋮ Math-Selfie ⋮ On approximate efficiency in multiobjective programming ⋮ Optimality conditions for a unified vector optimization problem with not necessarily preordering relations ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ Characterizing ϵ-properly efficient solutions ⋮ Scalarization method for Levitin-Polyak well-posedness of vectorial optimization problems ⋮ 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 ⋮ Conditional gradient method for vector optimization ⋮ Stability results for convex vector-valued optimization problems ⋮ Optimality conditions for metrically consistent approximate solutions in vector optimization ⋮ Cone characterizations of approximate solutions in real vector optimization ⋮ An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems ⋮ Improvement sets and vector optimization ⋮ Scalarization and pointwise well-posedness in vector optimization problems ⋮ Hadamard well-posed vector optimization problems ⋮ Scalarization of Levitin-Polyak well-posedness in vector optimization using weak efficiency ⋮ Unnamed Item ⋮ Perturbation of image and conjugate duality for vector optimization ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ Duality for vector optimization problems via a general scalarization ⋮ A unified vector optimization problem: complete scalarizations and applications ⋮ Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems ⋮ Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
Cites Work
- Nonconvex separation theorems and some applications in vector optimization
- Epsilon efficiency
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Stability results for approximately efficient solutions
- On several concepts for \(\varepsilon\)-efficiency
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- ε-approximate solutions in multiobjective optimization
- On Approximate Solutions in Convex Vector Optimization
- Unnamed Item
- Unnamed Item
This page was built for publication: On approximate solutions in vector optimization problems via scalarization
