On duality in linear fractional programming

  • C R Seshan


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.

Key words

Linear fractional programming duality 


  1. [1]
    Bector C R 1973Z. Opns. Res. 17 183MATHMathSciNetGoogle Scholar
  2. [2]
    Chadha S S 1971Z. Angew. Math. Mech. 51 560MATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    Charnes A and Cooper W W 1962Nav. Res. Log. Q. 9, 181MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    Craven B D and Mond B 1973J. Math. Anal. Appl. 42 507MATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    Dinkelbach W 1967Manage. Sci. 13 492MathSciNetGoogle Scholar
  6. [6]
    Jagannathan R 1973Z. Opns. Res. 17 1MATHMathSciNetGoogle Scholar
  7. [7]
    Kaska J 1969Econ. Mat. Obzor. 5 442MathSciNetGoogle Scholar
  8. [8]
    Schaible S 1974Z. Opns. Res. 17 187MathSciNetGoogle Scholar
  9. [9]
    Schaible S 1976Manage. Sci. 22 858MATHMathSciNetCrossRefGoogle Scholar
  10. [10]
    Sharma I C and Swarup K 1972Z. Opns. Res. 16 91MathSciNetGoogle Scholar
  11. [11]
    Swarup K 1968Unternehmensforchung 12 106MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Indian Academy of Sciences 1980

Authors and Affiliations

  • C R Seshan
    • 1
  1. 1.Department of Applied MathematicsIndian Institute of ScienceBangalore

Personalised recommendations