Superefficiency in Vector Optimization with Nearly Subconvexlike Set-Valued Maps

• DOI: 10.1007/s10957-007-9291-0
• Publication Date: 2007-10-29T17:16:31Z
• Authors: L. Y. Xia; J. H. Qiu
• Keywords: Theory of computation; Duality (order theory)

In the framework of locally convex topological vector spaces, we establish a scalarization theorem, a Lagrange multiplier theorem and duality theorems for superefficiency in vector optimization involving nearly subconvexlike set-valued maps.