An Iterative Algorithm For Solving Fractional Linear Programming Problem

In this paper, an iterative procedure integrated with Beal's method is given to solve the fractional linear programming problem (FLPP). The standard procedures for solving the FLPP are quite complex and monotonous to obtaining the optimum solution. To avoid this complexity of standard procedures, the proposed iterative procedure can be used to solving any FLPP easily in a minimum number of iterations. The solution step of proposed iterative procedure to solve FLPP is illustrated with the numerical examples.