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
Duality for Vector Optimization of Set-Valued Functions
โ Scribed by Wen Song
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 164 KB
- Volume
- 201
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
๐ 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
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
## Abstract In this paper we consider extensions of bounded vectorโvalued holomorphic (or harmonic or pluriharmonic) functions defined on subsets of an open set ฮฉ โ โ^__N__^ . The results are based on the description of vectorโvalued functions as operators. As an application we prove a vectorโvalue
## Abstract A real locally convex space is said to be __convenient__ if it is separated, bornological and Mackeyโcomplete. These spaces serve as underlying objects for a whole theory of differentiation and integration (see [4]) upon which infinite dimensional differential geometry is based (cf. [8]