๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Duality for a Minimax Programming Problem Containingn-Set Functions

โœ Scribed by H.C. Lai; J.C. Liu

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
125 KB
Volume
229
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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

Wolfe-Type Duality Involving (B, ฮท)
Wolfe-Type Duality Involving (B, ฮท)-Invex Functions For a Minmax Programming Problem
โœ C.R. Bector ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 165 KB

A sufficient optimality theorem is proved for a certain minmax programming ลฝ . problem under the assumptions of proper b, -invexity conditions on the functions involved in the objective and in the constraints. Next a dual is presented for such a problem and duality theorems relating the primal and t