Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued functions
From MaRDI portal
Publication:1036879
DOI10.1007/s10255-007-0374-3zbMath1198.90329OpenAlexW2133178126MaRDI QIDQ1036879
Publication date: 13 November 2009
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-007-0374-3
vector optimizationset-valued functionHenig efficiencynearly cone-subconvexlikenessLangrangian multiplier theorem
Related Items (3)
\(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces ⋮ The connectedness of the solutions set for set-valued vector equilibrium problems under improvement sets ⋮ On the density of Henig efficient points in locally convex topological vector spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- 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
- A theorem of the alternative and its application to the optimization of set-valued maps
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
- On the notion of proper efficiency in vector optimization
- Optimization of set-valued functions
- Proper efficiency in locally convex topological vector spaces
- The domination property for efficiency in locally convex spaces
- Lagrangian duality for minimization of nonconvex multifunctions
- Near-subconvexlikeness in vector optimization with set-valued functions
- Super efficiency in vector optimization with nearly convexlike set-valued maps.
- Some general conditions assuring \(\text{int }A+B=\text{int}(A+B)\)
- Theorems of the alternative for set-valued functions in infinite-dimensional spaces
- Super Efficiency in Vector Optimization
- Super efficiency in convex vector optimization
- Optimality conditions for maximizations of set-valued functions
- Set-valued analysis
This page was built for publication: Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued functions
