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

From MaRDI portal
Publication:2494290

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




Related Items (23)

On \(\epsilon\)-solutions for convex optimization problems with uncertainty dataε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max FunctionExistence results for strong vector equilibrium problems and their applicationsOn approximate efficiency in multiobjective programmingOn approximate solutions in vector optimization problems via scalarizationCoradiant sets and \(\varepsilon \)-efficiency in multiobjective optimizationOn approximate solutions for robust convex semidefinite optimization problemsApproximate quasi efficiency of set-valued optimization problems via weak subdifferentialOptimality conditions for approximate proper solutions in multiobjective optimization with polyhedral conesA generic approach to approximate efficiency and applications to vector optimization with set-valued mapsExistence and optimality conditions for approximate solutions to vector optimization problemsTwo Types of Approximate Saddle PointsDuality related to approximate proper solutions of vector optimization problemsOn \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problemsOptimality conditions for metrically consistent approximate solutions in vector optimization\(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraintsScalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued mapsOptimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problemsA 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 mapsOn approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimizationScalarizations for approximate quasi efficient solutions in multiobjective optimization problemsOn \(\epsilon\)-solutions for robust fractional optimization problems



Cites Work


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