A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
The paper is focused on approximate minimal points of a set in Hausdorff locally convex spaces. The authors introduce, via a point-to-set mapping \(G,\) a general approximate efficiency definition, called \(G(\varepsilon )\)-efficiency, and they use it to obtain existence results and properties on the behavior of the corresponding approximate efficient points when \(\varepsilon\) is fixed and by considering that \(\varepsilon\) tends to zero. The \(G(\varepsilon)\)-efficiency concept reduces to several well-known \(\varepsilon\)-efficiency notions given in the literature when particular point-to-set mappings \(G\) are considered. Finally, some results are applied to vector optimization problems with point-to-set mappings.
- scientific article; zbMATH DE number 854349
- scientific article; zbMATH DE number 5926450
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Approximate Benson proper efficiency in vector optimization with set-valued maps
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- A nonconvex vector minimization problem
- A Set-Valued Ekeland's Variational Principle in Vector Optimization
- A survey of recent developments in multiobjective optimization
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- Between Pareto efficiency and Pareto ε-efficiency
- Characterizing properties of approximate solutions for optimization problems
- e-weak minimal solutions of vector optimization problems with set-valued maps
- Ekeland's -variational principle for set-valued mappings
- Epsilon efficiency
- General Ekeland's variational principle for set-valued mappings.
- scientific article; zbMATH DE number 3662118 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- On approximate efficiency in multiobjective programming
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- On Approximate Solutions in Convex Vector Optimization
- On approximate solutions in vector optimization problems via scalarization
- On several concepts for \(\varepsilon\)-efficiency
- On the existence and stability of approximate solutions of perturbed vector equilibrium problems
- On two generalizations of Pareto minimality
- On variational principles, level sets, well-posedness, and \(\epsilon\)-solutions in vector optimization
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- Relationships between efficient set and -efficient set
- Theory of multiobjective optimization
- Vector variational principles; -efficiency and scalar stationarity
- Well posedness in vector optimization problems and vector variational inequalities
- Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
- Generalized \({\varepsilon }\)-quasi solutions of set optimization problems
- Approximate solutions in set-valued optimization problems with applications to maximal monotone operators
- Improvement sets and vector optimization
- -optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
- scientific article; zbMATH DE number 854349 (Why is no real title available?)
- Stability and scalarization in vector optimization using improvement sets
- Scalarization approach for approximation of weakly efficient solutions of set-valued optimization problems
- Limit behavior of approximate proper solutions in vector optimization
- Approximation of weak efficient solutions in vector optimization
- Approximately Efficient Solutions in Vector Optimization
- Further results on quasi efficient solutions in multiobjective optimization
- Approximate weak minimal solutions of set-valued optimization problems
- Vector optimization problems via improvement sets
- Duality related to approximate proper solutions of vector optimization problems
This page was built for publication: A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625654)
