\(e\)-proper saddle points and \(e\)-proper duality in vector optimization with set-valued maps
From MaRDI portal
Publication:514685
DOI10.11650/tjm.18.2014.3473zbMath1357.90148MaRDI QIDQ514685
Publication date: 9 March 2017
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/tjm.18.2014.3473
vector optimization with set-valued maps; \(E\)-Benson proper efficiency; \(E\)-proper duality; \(E\)-proper saddle points
90C29: Multi-objective and goal programming
90C30: Nonlinear programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
Set optimization using improvement sets, \(E\)-super efficiency of set-valued optimization problems involving improvement sets
Cites Work
- Weak \(E\)-optimal solution in vector optimization
- \(\epsilon\)-solutions in vector minimization problems
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- Approximate saddle-point theorems in vector optimization
- ON APPROXIMATE MINIMA 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