A Parametric Method for Solving the Linear Fractional Programming Problem
Abstract
This paper describes an approach for determining the optimal solution of the linear fractional programming problem. This approach is based mainly on a parametric analysis of a related linear substitution problem. Whereas existing algorithms for linear fractional programs concentrate solely on determining the optimal solution, the approach described in this paper provides the decision maker with additional insights and valuable information on the underlying decision problem. When the usual algorithms are applied, this additional information, which is gained by the parametric analysis of the substitution problem, can be obtained only by further computational effort.

