Superefficiency in vector optimization with nearly subconvexlike set-valued maps
From MaRDI portal
Publication:1956472
DOI10.1007/s10957-007-9291-0zbMath1194.90093OpenAlexW1983091703MaRDI QIDQ1956472
Publication date: 22 September 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-007-9291-0
scalarizationsuperefficiencyLagrangian multiplier theoremhenig proper efficiencynearly subconvexlike set-valued mapssuperduality
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)
Related Items (7)
A kind of unified super efficiency via assumption (A) and applications in vector optimization ⋮ Strict efficiency in vector optimization with nearly convexlike set-valued maps ⋮ Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps ⋮ \(E\)-super efficiency of set-valued optimization problems involving improvement sets ⋮ Unnamed Item ⋮ Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces ⋮ Strong duality with super efficiency in set-valued optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly subconvexlike set-valued maps and vector optimization problems
- 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
- Optimization of set-valued functions
- Connectedness of efficient solution sets for set-valued maps in normed spaces
- 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
- Optimality conditions for proper efficient solutions of vector set-valued optimization.
- Near-subconvexlikeness in vector optimization with set-valued functions
- Super efficiency in vector optimization with nearly convexlike set-valued maps.
- Strong efficiency in a locally convex space
- 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
This page was built for publication: Superefficiency in vector optimization with nearly subconvexlike set-valued maps
