𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Duality for MinmaxB-vex Programming Involvingn-Set Functions

✍ Scribed by C.R. Bector; M. Singh

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

No coin nor oath required. For personal study only.

✦ Synopsis

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 problem.

πŸ“œ SIMILAR VOLUMES

Optimality and Duality for Multiobjectiv
Optimality and Duality for Multiobjective Fractional Programming Involvingn-Set Functions
✍ Do Sang Kim; Cheong Lai Jo; Gue Myung Lee πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 160 KB

We consider a multiobjective fractional programming problem MFP involving vector-valued objective n-set functions in which their numerators are different from each other, but their denominators are the same. By using the concept of proper efficiency, we establish optimality conditions and duality re

Lagrangian Duality for Preinvex Set-Valu
Lagrangian Duality for Preinvex Set-Valued Functions
✍ Davinder Bhatia; Aparna Mehra πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 198 KB

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