Strict Efficiency in Vector Optimization with Nearly Convexlike Set‐Valued Maps

Xiaohong Hu, Zhimiao Fang and Yunxuan Xiong

Abstract and Applied Analysis, 2013, vol. 2013, issue 1

Abstract: The concept of the well posedness for a special scalar problem is linked with strictly efficient solutions of vector optimization problem involving nearly convexlike set‐valued maps. Two scalarization theorems and two Lagrange multiplier theorems for strict efficiency in vector optimization involving nearly convexlike set‐valued maps are established. A dual is proposed and duality results are obtained in terms of strictly efficient solutions. A new type of saddle point, called strict saddle point, of an appropriate set‐valued Lagrange map is introduced and is used to characterize strict efficiency.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2013/570918

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2013:y:2013:i:1:n:570918

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().