A duality model for a generalized minmax program
Meena K. Bector, Iqbal Husain, S. Chandra, C. R. Bector · Naval Research Logistics (NRL) · 1988
We consider a generalized minmax programming problem, and establish, under certain weaker convexity assumptions, the Fritz John sufficient optimality conditions for such a problem. A dual program is introduced and using those optimality conditions duality theorems are proved relating the dual and the primal. Duality for the generalized fractional programming problem is considered as an application of the results proved.