On algorithmic equivalence in linear fractional programming

On algorithmic equivalence in linear fractional programming
HTML articles powered by AMS MathViewer

by B. Mond PDF

Math. Comp. 37 (1981), 185-187 Request permission

This paper compares the effectiveness of three published algorithms for solving the linear fractional programming problem.

References

A. Charnes and W. W. Cooper, Programming with linear fractional functionals, Naval Res. Logist. Quart. 9 (1962), 181–186. MR 152370, DOI 10.1002/nav.3800090303
J. R. Isbell and W. H. Marlow, Attrition games, Naval Res. Logist. Quart. 3 (1956), 71–94. MR 83408, DOI 10.1002/nav.3800030108
Béla Martos, Hyperbolic programming, Naval Res. Logist. Quart. 11 (1964), 135–155. MR 182456, DOI 10.1002/nav.3800110204
Béla Martos, Nonlinear programming, North-Holland Publishing Co., Amsterdam-Oxford; American Elsevier Publishing Co., Inc., New York, 1975. Theory and methods. MR 0496692
Harvey M. Wagner and John S. C. Yuan, Algorithmic equivalence in linear fractional programming, Management Sci. 14 (1968), 301–306. MR 243821, DOI 10.1287/mnsc.14.5.301