Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps
DOI10.1155/2011/839679zbMATH Open1213.49026OpenAlexW1997573354WikidataQ59267390 ScholiaQ59267390MaRDI QIDQ623651FDOQ623651
Authors: S. J. Li, Yangdong Xu 
Publication date: 8 February 2011
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/230120
Recommendations
- Strict efficiency in vector optimization with nearly convexlike set-valued maps
- Benson proper efficiency in the vector optimization of set-valued maps
- \(e\)-proper efficient solutions of vector optimization problems with set-valued maps
- scientific article; zbMATH DE number 1559029
- Nearly subconvexlike set-valued maps and vector optimization problems
duality resultsLagrange multipliervector optimizationset-valued Lagrange maptightly proper saddle point
Duality theory (optimization) (49N15) Optimality conditions for free problems in two or more independent variables (49K10)
Cites Work
- Existence and Lagrangian duality for maximization of set-valued functions
- Optimality conditions for set-valued optimization problems
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
- Proper efficiency in locally convex topological vector spaces
- 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
- Strong efficiency in a locally convex space
- Proper efficiency and the theory of vector maximization
- Super Efficiency in Vector Optimization
- Degrees of Efficiency and Degrees of Minimality
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- 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
- New generalized convexity notion for set-valued maps and application to vector optimization
- On characterizations of proper efficiency for nonconvex multiobjective optimization
- 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
- On the notion of proper efficiency in vector optimization
- Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints
- Density Results for Proper Efficiencies
- Title not available (Why is that?)
- Nearly subconvexlike set-valued maps and vector optimization problems
- On proper efficiencies in locally convex spaces -- a survey
- Hartley proper efficiency in multifunction optimization
Cited In (4)
This page was built for publication: Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623651)
