Equivalence in linear fractional programming

In this paper two algorithms are suggested for solving a linear fractional problem whatever the feasible region is. Such algorithms can be interpreted as a modified version of Martos and Charnes-Cooper algorithms. Successively, it will be shown that the two methods are algorithmically equivalent in the sense that they generate the same finite sequence of points leading to an optimal solution. This last result can be viewed as an extension of the one given by Wagner-Y4sc:uan[14] for a compact feasible region