\(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
From MaRDI portal
Publication:2448178
DOI10.1007/s11590-013-0620-yzbMath1317.90273OpenAlexW2039165308MaRDI QIDQ2448178
Yang, Xinmin, Jian-Wen Peng, Zhi-Ang Zhou
Publication date: 30 April 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-013-0620-y
set-valued mapsgeneralized cone subconvexlikeness\(\epsilon\)-global proper saddle point\(\epsilon\)-global properly efficient element
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (12)
Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ Pareto efficiency without topology ⋮ Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty ⋮ Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces ⋮ Approximate solutions of vector optimization problems via improvement sets in real linear spaces ⋮ Higher-order optimality conditions and duality for approximate solutions in non-convex set-valued optimization ⋮ Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces ⋮ Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization ⋮ Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data ⋮ Characterizations of the solution sets of generalized convex fuzzy optimization problem ⋮ Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria ⋮ Approximate solutions for nonconvex set-valued optimization and vector variational inequality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
- Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency
- Proper efficiency in vector optimization on real linear spaces.
- Some properties of approximate solutions for vector optimization problem with set-valued functions
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- Benson proper efficiency in the vector optimization of set-valued maps
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
- The optimality conditions for vector optimization of set-valued maps
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- Near-subconvexlikeness in vector optimization with set-valued functions
- New generalized convexity notion for set-valued maps and application to vector optimization
- Theorems of the alternative and optimality conditions
- Theorems of the alternative and optimization with set-valued maps
- Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- Globally proper saddle point in ic-cone-convexlike set-valued optimization problems
- Vector Optimization
- ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces
- e-weak minimal solutions of vector optimization problems with set-valued maps
This page was built for publication: \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
