Abstract
An algorithm called Ratio Multiplex Algorithm to solve Linear Fractional Programming Problems has been presented in this paper, Ratio Multiplex Algorithm attempts to select a group- of entering variables based on the ratios of the contribution coefficients of the decision variable both in the numerator and denominator of the objective function. This reduces the number of iterations and hence saving in time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
SAKTHIVEL S, “A Multiplex Aigorithm to Solve large Scale Linear Programming Problems”. Ph.D. thesis, Computer Centre, College of Engineering, Anna University, Madras (1984).
SAKTHIVEL S AND NATESAN TR, “A Multiplex Aigorithm to Solve large Scale Linear Programming Problems”. Third Symposium — IFAC/IFORS Large Scale Systems: Theory, Applications, and Impacts, Warsaw, Poland (1983).
SANKARAIYER P, “A Computer Oriented Ratio Aigorithm to Solve Linear Fractional Programming Problems”. A Ph.D. thesis, Department of Computer Science and Engineering, Alagappa University, karaikudi (1994).
SAKTHIVEL S AND SANKARAIYER P, “Ratio Aigorithm for the Solution of Linear Fractional Programming Problems”, Proceeding of A.M.S.E. International Conference, Vol. 1 pp 19–29 (1990).
CHARNES A AND COOPER WW, “Programming with Linear Fractional Functionals”, Navel Res. Logist Quart. 9, 181–186 (1962).
KANTISWARUP, “Linear Fractional Functional Programming”, Operations Research, Vol. 13, 1029–1036 (1965).
RAGNER FRISCH, “The Multiplex Method for Linear Programming and Quadratic Programming”, Memorandum of University of Oslo (1957).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Naganathan, E.R., Sakthivel, S. A Ratio Multiplex Algorithm to Solve Linear Fractional Programming Problems. OPSEARCH 35, 214–225 (1998). https://doi.org/10.1007/BF03399216
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03399216