Volume 7, Number 2, August 2006, pp. 269-275
Shashi K. Mishra and Norma G. Rueda
Key words:
minimax programming, duality, generalized convex functions
Mathematices Subject Classification: 90C47, 90C46
ONLINE SUBSCRIPTION (Institutional Subscription Only)
Copyright© 2006 Yokohama Publishers
Back

Abstract:
A sufficient optimality theorem is proved for a certain minimax programming problem under the assumptions of proper (b,η,φ)-univex conditions on the functions involved for such a problem. A dual is defined for this problem and duality theorems relating the primal and the dual are proved. The results presented in this paper extend earlier works in the literature to a wider class of functions.

Wolfe-type duality involving univex functions for a minimax programming problem