Abstract
This paper proposes an algorithm for solving a linear fractional functionals program when some of its constraints are homogeneous. Using these homogeneous constraints a transformation matrix T is constructed. Matrix T transforms the given problem into another linear fractional functional program but with fewer constraints. A relationship between these two problems, which ensures that the solution of the original problem can be recovered from the solution of the transformed problem, is established. A simple numerical example illustrates the steps of the proposed algorithm.
Similar content being viewed by others
References
CHARNES, A. AND COOPER, W. (1962), Programming with Linear Fractional Functions, Nav. Res. Log. Quart. Vol. IX. 181–186.
DANTZIG, G.B. (1963), Linear Programming Methods and Applications, Princeton University Press, Princeton, New Jersey.
GASS, S.I. (1985), Linear Programming Methods and Applications, McGraw-Hill Book Company, New York.
MARTOS, B. (1960), Hyperbolic Programming (in Hungarian) Publ. Maths. Insti. Hung. Ac-Sc., 5, Sec. B; (also in English) 1964), Nav. Res. Mem. 113. 383–406.
SWARUP, K. (1965), Linear Fractional Functionals Programming, Operations Research, 13; 1029–1036.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chadha, S.S. A Linear Fractional Program with Homogeneous Constraints by. OPSEARCH 36, 390–398 (1999). https://doi.org/10.1007/BF03398591
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03398591