Hossain, MozzemMorshed, MonjurUddin, Mohammad Forhad2010-10-072010-10-072007http://hdl.handle.net/10361/383In 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. [13] derived an algorithm considering the restricted normal form. In this paper, the algorithm of Forhad et al. [13] 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.enLinear fractional programming (LFP)Canonical and noncanonical formTransformationSimplex methodArticle