Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps

DOI10.1155/2011/839679zbMath1213.49026WikidataQ59267390 ScholiaQ59267390MaRDI QIDQ623651

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

vector optimization; Lagrange multiplier; duality results; set-valued Lagrange map; tightly proper saddle point

Mathematics Subject Classification ID

49N15: Duality theory (optimization)

49K10: Optimality conditions for free problems in two or more independent variables

Cites Work

Unnamed Item
Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
Nearly subconvexlike set-valued maps and vector optimization problems
On proper efficiencies in locally convex spaces -- a survey
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
On the notion of proper efficiency in vector optimization
Proper efficiency in locally convex topological vector spaces
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.
Hartley proper efficiency in multifunction optimization
Near-subconvexlikeness in vector optimization with set-valued functions
New generalized convexity notion for set-valued maps and application to vector optimization
Super efficiency in vector optimization with nearly convexlike set-valued maps.
On characterizations of proper efficiency for nonconvex multiobjective optimization
Superefficiency in vector optimization with nearly subconvexlike set-valued maps
Strong efficiency in a locally convex space
Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints
Proper efficiency and the theory of vector maximization
Proper Efficient Points for Maximizations with Respect to Cones
On Cone-Efficiency, Cone-Convexity and Cone-Compactness
Super Efficiency in Vector Optimization
Density Results for Proper Efficiencies
Degrees of Efficiency and Degrees of Minimality