Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
DOI10.3934/jimo.2015.11.673zbMath1305.90365OpenAlexW2318326611MaRDI QIDQ2514680
Jin Yang, Hong Yan, Ying Gao, Yang, Xinmin
Publication date: 3 February 2015
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2015.11.673
vector optimization problemsset-valued mapsapproximate solutionsgeneralized subconvexlikescalarizationsLagrange multiplier theorems
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (7)
Cites Work
- Optimality conditions for approximate solutions of vector optimization problems
- Nearly subconvexlike set-valued maps and vector optimization problems
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
- Ekeland's variational principle in locally convex spaces and the density of extremal points
- A generalized Ekeland vector variational principle and its applications in optimization
- On approximate efficiency in multiobjective programming
- Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Epsilon efficiency
- Alternative theorems and optimality conditions with weakened convexity
- Characterizations of the Benson proper efficiency for nonconvex 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
- Lagrange multipliers and saddle points in multiobjective programming
- General Ekeland's variational principle for set-valued mappings.
- Near-subconvexlikeness in vector optimization with set-valued functions
- Theorems of the alternative and optimization with set-valued maps
- Existence and optimality conditions for approximate solutions to vector optimization problems
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Two Types of Approximate Saddle Points
- Dual Characterization and Scalarization for Benson Proper Efficiency
- A Set-Valued Ekeland's Variational Principle in Vector Optimization
- Convexlike alternative theorems and mathematical programming
- Proper Efficient Points for Maximizations with Respect to Cones
- On lagrange-kuhn-tucker multipliers for pareto optimization problems
- On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
- OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
- Optimality conditions for vector optimisation with set-valued maps
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- Unnamed Item
- Unnamed Item
This page was built for publication: Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps