𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lagrangian Duality for Preinvex Set-Valued Functions

✍ Scribed by Davinder Bhatia; Aparna Mehra

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
198 KB
Volume
214
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

✦ Synopsis

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 programming problem involving preinvex set-valued functions and duality results are established.

πŸ“œ SIMILAR VOLUMES

Duality for Vector Optimization of Set-V
Duality for Vector Optimization of Set-Valued Functions
✍ Wen Song πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 164 KB

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.

Lagrangian Multipliers, Saddle Points, a
Lagrangian Multipliers, Saddle Points, and Duality in Vector Optimization of Set-Valued Maps
✍ Zhong-Fei Li; Guang-Ya Chen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 266 KB

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

Duality for MinmaxB-vex Programming Invo
Duality for MinmaxB-vex Programming Involvingn-Set Functions
✍ C.R. Bector; M. Singh πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 237 KB

A minmax programming problem involving several B-vex n-set functions is considered. Necessary and sufficient optimality theorems and Wolfe type duality Ε½ . results are established. Duality for the n-set generalized minmax fractional programming problem is derived as a special case of the main proble