Linear fractional programming. A new bicriteria approach

The linear fractional programming problem is formulated and a new algorithm for solving this type of problem is presented. In each iteration of the method one proceeds to a very narrow evaluation of the error incurred by the current approximation to the optimum. This error may be obtained by some parametric methods, but in the present algorithm the authors use a distinct analysis based on a suggestive graphical bicriteria representation. Some computational experiments comparing the algorithms were carried out.