An algorithm for restricted normal form to solve dual type non-canonical linear fractional programming problem
MetadataShow full item record
In this paper, an algorithm is presented to solve non-canonical linear fractional programming (LFP) problem, considering the restricted normal form. It provides a new way to solve all types of LFP problems. When the LFP problem is only in canonical form, Forhad et al.  derived an algorithm considering the restricted normal form. In this paper, the algorithm of Forhad et al.  has been generalized to solve the LFP problem which is non-canonical form also. This algorithm required neither transformation nor the iterative calculations of simplex method. But it requires only algebraic elimination.