ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
From MaRDI portal
Publication:5290835
DOI10.1080/01630560500538789zbMath1137.90654OpenAlexW1975604437MaRDI QIDQ5290835
Bienvenido Jiménez, Vicente Novo Sanjurjo, César Gutiérrez
Publication date: 3 May 2006
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/178229
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (12)
Advancing local search approximations for multiobjective combinatorial optimization problems ⋮ On approximate optimality conditions for robust multi-objective convex optimization problems ⋮ Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications ⋮ Unnamed Item ⋮ Optimality conditions for metrically consistent approximate solutions in vector optimization ⋮ Cone characterizations of approximate solutions in real vector optimization ⋮ Unnamed Item ⋮ Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems ⋮ Unnamed Item ⋮ On approximate solutions for nonsmooth robust multiobjective optimization problems ⋮ Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems ⋮ Approximate solutions of multiobjective optimization problems
Cites Work
- Unnamed Item
- \(\epsilon\)-solutions in vector minimization problems
- Epsilon efficiency
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- Epsilon approximate solutions for multiobjective programming problems
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- 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
- Limiting behaviour of the approximate first order and second order directional derivatives for a convex function
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- ε-approximate solutions in multiobjective optimization
- On Approximate Solutions in Convex Vector Optimization
This page was built for publication: ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
