Optimality conditions of vector set-valued optimization problem involving relative interior
From MaRDI portal
Publication:535497
DOI10.1155/2011/183297zbMath1230.49013WikidataQ59267254 ScholiaQ59267254MaRDI QIDQ535497
Publication date: 13 May 2011
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/232014
convex-like set-valued map; generalized Kuhn-Tucker condition; scalarization theorem,; separated locally convex spaces
49J53: Set-valued and variational analysis
49K27: Optimality conditions for problems in abstract spaces
Cites Work
- Strong duality for generalized convex optimization problems
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- 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
- Near-subconvexlikeness in vector optimization with set-valued functions
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions.
- Theorems of the alternative and optimization with set-valued maps
- Lagrangian duality and cone convexlike functions
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Proper Efficient Points for Maximizations with Respect to Cones
