Strict efficiency in vector optimization with nearly convexlike set-valued maps
From MaRDI portal
Publication:370046
DOI10.1155/2013/570918zbMath1278.90358OpenAlexW2059758281WikidataQ58917139 ScholiaQ58917139MaRDI QIDQ370046
Xiaohong Hu, Yunxuan Xiong, Zhi-Miao Fang
Publication date: 19 September 2013
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/570918
Cites Work
- Unnamed Item
- Unnamed Item
- Existence and Lagrangian duality for maximization of set-valued functions
- An improved definition of proper efficiency for vector maximization with respect to cones
- Proper efficiency with respect to cones
- Benson proper efficiency in the vector optimization of set-valued maps
- Optimality conditions for set-valued optimization problems
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
- Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
- Lagrangian duality for minimization of nonconvex multifunctions
- Nonconvex vector optimization of set-valued mappings.
- Near-subconvexlikeness in vector optimization with set-valued functions
- Super efficiency in vector optimization with nearly convexlike set-valued maps.
- Superefficiency in vector optimization with nearly subconvexlike set-valued maps
- Proper efficiency and the theory of vector maximization
- Characterization of solutions of multiobjective optimization problem
- Proper Efficient Points for Maximizations with Respect to Cones
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Super Efficiency in Vector Optimization
- Degrees of Efficiency and Degrees of Minimality
This page was built for publication: Strict efficiency in vector optimization with nearly convexlike set-valued maps
