On duality in linear fractional programming
- Cite this article as:
- Seshan, C.R. Proc. Indian Acad. Sci. (Math. Sci.) (1980) 89: 35. doi:10.1007/BF02881023
- 35 Downloads
In this paper, a dual of a given linear fractional program is defined and the weak, direct and converse duality theorems are proved. Both the primal and the dual are linear fractional programs. This duality theory leads to necessary and sufficient conditions for the optimality of a given feasible solution. A unmerical example is presented to illustrate the theory in this connection. The equivalence of Charnes and Cooper dual and Dinkelbach’s parametric dual of a linear fractional program is also established.