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.
Optimization of Set-Valued Functions
β Scribed by L.J. Lin
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 662 KB
- Volume
- 186
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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 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