Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems

DOI10.1007/s10898-004-5904-4zbMath1149.90398OpenAlexW1997843257MaRDI QIDQ2494290

Vicente Novo Sanjurjo, Bienvenido Jiménez, César Gutiérrez

Publication date: 26 June 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-5904-4

zbMATH Keywords

\(\varepsilon\)-subdifferentialLagrangian functionsApproximate solutions\(\varepsilon\)-Pareto optimality\(\varepsilon\)-saddle-points

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items (23)

On \(\epsilon\)-solutions for convex optimization problems with uncertainty data ⋮ ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function ⋮ Existence results for strong vector equilibrium problems and their applications ⋮ On approximate efficiency in multiobjective programming ⋮ On approximate solutions in vector optimization problems via scalarization ⋮ Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization ⋮ On approximate solutions for robust convex semidefinite optimization problems ⋮ Approximate quasi efficiency of set-valued optimization problems via weak subdifferential ⋮ Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones ⋮ A generic approach to approximate efficiency and applications to vector optimization with set-valued maps ⋮ Existence and optimality conditions for approximate solutions to vector optimization problems ⋮ Two Types of Approximate Saddle Points ⋮ Duality related to approximate proper solutions of vector optimization problems ⋮ On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems ⋮ Optimality conditions for metrically consistent approximate solutions in vector optimization ⋮ \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems ⋮ A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps ⋮ On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization ⋮ Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems ⋮ On \(\epsilon\)-solutions for robust fractional optimization problems

Cites Work

• On duality theory in multiobjective programming
• Duality theory for maximizations with respect to cones
• \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
• Duality theory in multiobjective programming
• \(\varepsilon\)-optimality and duality for multiobjective fractional programming
• Epsilon approximate solutions for multiobjective programming problems
• Approximate saddle-point theorems in vector optimization
• \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• ε-Optimal solutions in nondifferentiable convex programming and some related questions
• ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
• e-weak minimal solutions of vector optimization problems with set-valued maps

This page was built for publication: Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems