✦ LIBER ✦
Wolfe-Type Duality Involving (B, η)-Invex Functions For a Minmax Programming Problem
✍ Scribed by C.R. Bector
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 165 KB
- Volume
- 201
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
✦ Synopsis
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 the dual are proved.
Ž . The dual for a minimax generalized fractional programming problem is presented as special case of the main problem considered in the paper.