ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps
From MaRDI portal
Publication:5505147
DOI10.1080/02331930802355374zbMath1152.90593OpenAlexW1972548296MaRDI QIDQ5505147
Publication date: 23 January 2009
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930802355374
vector optimization with set-valued maps\(\epsilon \)-conjugate duality\(\epsilon \)-conjugate maps\(\epsilon \)-weak efficiency\(\epsilon \)-weak subgradients
Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48) Optimality conditions for problems in abstract spaces (49K27)
Related Items (4)
Characterizing ϵ-properly efficient solutions ⋮ Sensitivity analysis for a Lagrange dual problem to a vector optimization problem ⋮ Duality related to approximate proper solutions of vector optimization problems ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
Cites Work
- Unnamed Item
- Nonconvex scalarization in set optimization with set-valued maps
- \(\epsilon\)-solutions in vector minimization problems
- Epsilon efficiency
- Existence and Lagrangian duality for maximization of set-valued functions
- Theorems of the alternative for multifunctions with applications to optimization: General results
- On supremum of a set in a multidimensional space
- Conjugate maps and duality in multiobjective optimization
- Conjugate duality in vector optimization
- Benson proper efficiency in the vector optimization of set-valued maps
- A theorem of the alternative and its application to the optimization of set-valued maps
- Optimality conditions for set-valued optimization problems
- \(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming
- Stability results for approximately efficient solutions
- \(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
- On several concepts for \(\varepsilon\)-efficiency
- Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
- Conjugate duality in set-valued vector optimization
- Lagrangian duality for preinvex set-valued functions
- Nonconvex vector optimization of set-valued mappings.
- On cone d. c. optimization and conjugate duality
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- Epsilon approximate solutions for multiobjective programming problems
- Convergence of minimal and approximate minimal elements of sets in partially ordered vector spaces
- Approximate saddle-point theorems in vector optimization
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- Duality for vector optimization of set-valued functions
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- Set-relations and optimality conditions in set-valued maps
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Theorems of the alternative for set-valued functions in infinite-dimensional spaces
- ε-approximate solutions in multiobjective optimization
- A generalization of ekellandz’s variational principle
- On Approximate Solutions in Convex Vector Optimization
- Between Pareto efficiency and Pareto ε-efficiency
- Approximately Efficient Solutions in Vector Optimization
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- e-weak minimal solutions of vector optimization problems with set-valued maps
- Existence of \(\varepsilon\)-minima for vector optimization problems
This page was built for publication: ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps
