Some special situations in linear fractional programming problem: An algorithmic comparison

This paper presents a comparative study of algorithms due to Charnes-Cooper, Martos and Wolf for solving linear fractional programming problem, when the feasible region F is unbounded. It also compares the three algorithms with respect to identification of bad-points and singular-points, if present in F. It is observed that Wolf’s algorithm is as good as Charnes-Cooper’s algorithm for the case when F is unbounded and is comparatively better than the other two, as far as identification of bad-points and singular-points is concerned.