Equivalence of various linearization algorithms for linear fractional programming

This paper considers four algorithms for linear fractional programming and shows that they are all Frank-Wolfe type linearization algorithms. These algorithms are those proposed by Isbell and Marlow, Mangasarian, Bitran and Novaes; and Bhatt. It is shown that these algorithms all use essentially the same sequence of l.p.s to generate the same sequence of feasible points that leads to the optimal solution.