Strict efficiency in vector optimization with nearly convexlike set-valued maps
From MaRDI portal
Publication:370046
DOI10.1155/2013/570918zbMATH Open1278.90358OpenAlexW2059758281WikidataQ58917139 ScholiaQ58917139MaRDI QIDQ370046FDOQ370046
Authors: Xiaohong Hu, Yunxuan Xiong, Zhimiao 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
Recommendations
- Nearly subconvexlike set-valued maps and vector optimization problems
- Strict efficiency of set-valued optimization and scalar set-valued Lagrange mapping
- Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps
- Super efficiency in vector optimization with nearly convexlike set-valued maps.
- ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS
Cites Work
- Existence and Lagrangian duality for maximization of set-valued functions
- Optimality conditions for set-valued optimization problems
- Title not available (Why is that?)
- 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
- 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
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Super Efficiency in Vector Optimization
- Degrees of Efficiency and Degrees of Minimality
- An improved definition of proper efficiency for vector maximization with respect to cones
- Proper efficiency with respect to cones
- Proper Efficient Points for Maximizations with Respect to Cones
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Benson proper efficiency in the vector optimization of set-valued maps
- Lagrangian duality for minimization of nonconvex multifunctions
- Characterization of solutions of multiobjective optimization problem
- Title not available (Why is that?)
Cited In (10)
- Title not available (Why is that?)
- Strict efficiency in vector optimization with ic-cone-convexlike set-valued functions
- Strict efficiency of set-valued optimization and scalar set-valued Lagrange mapping
- Nearly subconvexlike set-valued maps and vector optimization problems
- ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS
- Title not available (Why is that?)
- Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps
- Title not available (Why is that?)
- Strict efficiency in set-valued optimization
- Title not available (Why is that?)
This page was built for publication: Strict efficiency in vector optimization with nearly convexlike set-valued maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q370046)
