
doi: 10.1007/bf01415516
The author shows that the linearization methods proposed by \textit{J. R. Isbell} and \textit{W. H. Marlow} [Nav. Res. Logist. Quart. 3, 71-94 (1956)], \textit{O. L. Mangasarian} [J. Oper. Res. Soc. Japan 12, 1-10 (1969; Zbl 0257.90043)], \textit{G. R. Bitran} and \textit{T. L. Magnanti} [Oper. Res. 24, 675-699 (1976; Zbl 0361.90073)] and the author [Cah. Cent. Etud. Rech. Oper. 23, 53-56 (1981; Zbl 0452.90077)] for the solution of the linear fractional programming probem are algorithmically equivalent in the sense that if they start with the same initial solution, they will generate the same auxiliary linear programming problem and hence the same sequence of points leading to an optimal solution of the linear fractional programming problem.
Numerical mathematical programming methods, Linear programming, linear fractional programming, linearization, Fractional programming
Numerical mathematical programming methods, Linear programming, linear fractional programming, linearization, Fractional programming
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 9 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
