Optimality conditions for metrically consistent approximate solutions in vector optimization

DOI10.1007/S10957-007-9191-3MaRDI QIDQ2471086zbMATH OpenOpenAlexFDO

Authors B. Jiménez, V. Novo, C. 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

zbMATH Keywords

\(\epsilon\)-efficiencyGauge functionalsgeneralized Chebyshev normsoptimality conditionsscalarizationVector optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Review text

The authors analyze approximate solutions of vector optimization problems via a metrically consistent \(\epsilon\)-efficient concept. Several properties of the \(\epsilon\)-efficient set are studied. By scalarization, necessary and sufficient conditions for approximate solutions of convex and nonconvex vector optimization problems are provided. A characterization is obtained via generalized Chebyshev norms, attaining the same precision in the vector problem as in the scalarization.

Recommendations

• A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
• Existence and optimality conditions for approximate solutions to vector optimization problems
• Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
• Optimality conditions for approximate solutions of convex semi-infinite vector optimization problems
• On Approximate Solutions in Convex Vector Optimization

Cites work

• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• \(\epsilon\)-solutions in vector minimization problems
• -optimality and duality for multiobjective fractional programming
• \(\varepsilon\)-optimality for multiobjective programming on a Banach space
• \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
• A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
• Approximate saddle-point theorems in vector optimization
• Epsilon efficiency
• scientific article; zbMATH DE number 3662118 (Why is no real title available?)
• scientific article; zbMATH DE number 2063780 (Why is no real title available?)
• scientific article; zbMATH DE number 5066294 (Why is no real title available?)
• Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
• New closedness results for efficient sets in multiple objective mathematical programming
• Nonconvex separation theorems and some applications in vector optimization
• ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
• On approximate solutions in vector optimization problems via scalarization
• On several concepts for \(\varepsilon\)-efficiency
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• On variational principles, level sets, well-posedness, and \(\epsilon\)-solutions in vector optimization
• Relationships between efficient set and -efficient set
• Stability results for approximately efficient solutions
• Theory of multiobjective optimization
• Variational methods in partially ordered spaces
• Vector optimization. Set-valued and variational analysis.
• Vector variational principles; -efficiency and scalar stationarity
• ε-approximate solutions in multiobjective optimization
• ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function

Cited in

(22)

• Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
• Stability results for approximately efficient solutions
• An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
• Existence and optimality conditions for approximate solutions to vector optimization problems
• Cone characterizations of approximate solutions in real vector optimization
• Approximate solutions of multiobjective optimization problems
• Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
• Optimality conditions for approximate solutions of convex semi-infinite vector optimization problems
• Characterizing -properly efficient solutions
• A combined scalarizing method for multiobjective programming problems
• Optimality conditions for Tanaka's approximate solutions in vector optimization
• scientific article; zbMATH DE number 6508503 (Why is no real title available?)
• Remarks about approximate solutions in vector optimization
• \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
• scientific article; zbMATH DE number 4045500 (Why is no real title available?)
• On approximating weakly/properly efficient solutions in multi-objective programming
• On minkowski metric and weighted tchebyshev norm in vector optimization^∗
• Relative Optimality Conditions and Algorithms for Treespace Fréchet Means
• scientific article; zbMATH DE number 1568710 (Why is no real title available?)
• Optimality conditions for approximate solutions of vector optimization problems
• A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
• A generic approach to approximate efficiency and applications to vector optimization with set-valued maps

This page was built for publication: Optimality conditions for metrically consistent approximate solutions in vector optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471086)