This paper establishes an alternative theorem for generalized inequality-equality Ž . systems of set-valued maps. Based on this, several Lagrange multiplier type as well as saddle point type necessary and sufficient conditions are obtained for the existence of weak minimizers in vector optimization
Lagrangian Duality in Set-Valued Optimization
✍ Scribed by E. Hernández; L. Rodríguez-Marín
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 381 KB
- Volume
- 134
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, generalizing the concept of cone convexity, we have defined cone preinvexity for set-valued functions and given an example in support of this generalization. A Farkas᎐Minkowski type theorem has been proved for these functions. A Lagrangian type dual has been defined for a fractional p
In this paper, conjugate duality results for convexlike set-valued vector optimization problems are presented under closedness or boundedness hypotheses. Some properties of the value mapping of a set-valued vector optimization problem are studied. A conjugate duality result is also proved for a conv
In this note, a general cone separation theorem between two subsets of image space is presented. With the aid of this, optimality conditions and duality for vector optimization of set-valued functions in locally convex spaces are discussed.