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

zbMATH Keywords

duality resultsLagrange multipliervector optimizationset-valued Lagrange maptightly proper saddle point

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Optimality conditions for free problems in two or more independent variables (49K10)

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

Cites Work

• scientific article; zbMATH DE number 1145345 (Why is no real title available?)
• An improved definition of proper efficiency for vector maximization with respect to cones
• Benson proper efficiency in the vector optimization of set-valued maps
• Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
• Degrees of Efficiency and Degrees of Minimality
• Density Results for Proper Efficiencies
• Existence and Lagrangian duality for maximization of set-valued functions
• Hartley proper efficiency in multifunction optimization
• Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints
• Lagrangian duality for minimization of nonconvex multifunctions
• Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
• Near-subconvexlikeness in vector optimization with set-valued functions
• Nearly subconvexlike set-valued maps and vector optimization problems
• New generalized convexity notion for set-valued maps and application to vector optimization
• Nonconvex vector optimization of set-valued mappings.
• On Cone-Efficiency, Cone-Convexity and Cone-Compactness
• On characterizations of proper efficiency for nonconvex multiobjective optimization
• On proper efficiencies in locally convex spaces -- a survey
• On the notion of proper efficiency in vector optimization
• Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
• Optimality conditions for set-valued optimization problems
• Proper Efficient Points for Maximizations with Respect to Cones
• Proper efficiency and the theory of vector maximization
• Proper efficiency in locally convex topological vector spaces
• Proper efficiency with respect to cones
• Strong efficiency in a locally convex space
• Super Efficiency in Vector Optimization
• Super efficiency in vector optimization with nearly convexlike set-valued maps.
• Superefficiency in vector optimization with nearly subconvexlike set-valued maps

Cited In (5)

• Title not available (Why is no real title available?)
• Strict efficiency of set-valued optimization and scalar set-valued Lagrange mapping
• Title not available (Why is no real title available?)
• Strict efficiency in vector optimization with nearly convexlike set-valued maps
• Well-posedness for tightly proper efficiency in set-valued optimization problem

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)