| Article ID: | iaor1989728 |
| Country: | India |
| Volume: | 10 |
| Issue: | 1 |
| Start Page Number: | 193 |
| End Page Number: | 205 |
| Publication Date: | Jan 1989 |
| Journal: | Journal of Information & Optimization Sciences |
| Authors: | Bector C.R., Bector Meena K. |
| Keywords: | programming: fractional |
A generalized minmax programming problem is considered and under certain weaker convexity assumptions Fritz John sufficient optimality conditions are proved 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 generalized fractional programming problem is considered as an application of the results proved.