Optimality conditions of vector set-valued optimization problem involving relative interior

DOI10.1155/2011/183297MaRDI QIDQ535497zbMATH OpenOpenAlexWikidataFDO

Authors Zhiang Zhou

Publication date 13 May 2011

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/232014

zbMATH Keywords

convex-like set-valued mapgeneralized Kuhn-Tucker conditionscalarization theorem,separated locally convex spaces

Mathematics Subject Classification ID

Set-valued and variational analysis (49J53) Optimality conditions for problems in abstract spaces (49K27)

Recommendations

• Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces
• Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
• Optimality conditions for weak solutions of vector optimization problems through quasi interiors and improvement sets
• The optimality conditions of weak efficient solutions for the optimization problem of a class of generalized convex set-valued mapping
• The optimality conditions of weakly efficient element for set-valued optimization problems based on quasi-relative interior

Cites work

• A theorem of the alternative and its application to the optimization of set-valued maps
• Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions.
• Benson proper efficiency in the vector optimization of set-valued maps
• Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
• Characterizations of the Benson proper efficiency for nonconvex vector optimization
• Lagrangian duality and cone convexlike functions
• Near-subconvexlikeness in vector optimization with set-valued functions
• On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Proper Efficient Points for Maximizations with Respect to Cones
• Regularity Conditions via Quasi-Relative Interior in Convex Programming
• Strong duality for generalized convex optimization problems
• Theorems of the alternative and optimization with set-valued maps

Cited in

(4)

• The optimality conditions of weakly efficient element for set-valued optimization problems based on quasi-relative interior
• The optimality conditions of weak efficient solutions for the optimization problem of a class of generalized convex set-valued mapping
• scientific article; zbMATH DE number 6165540 (Why is no real title available?)
• Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior

This page was built for publication: Optimality conditions of vector set-valued optimization problem involving relative interior

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535497)