Simplex Method for Solving Optimization Problems having Maximized Objective Functions in Linear Fractional Programming

In this research paper, we have proposed the simplex method for maximized objective functions in linear fractional programming. By the suitable transformation, one can easily convert the linear fractional programming problem into a linear programming problem. By the solution of linear programming problem thus obtained, we can get an optimal solution of linear fractional programming problem. In the proposed simplex method, the coefficients of the variables under consideration in the transformed linear programming problem are put into the form of a matrix. After applying suitable row transformations, one can easily get the optimal solution of the transformed linear programming problem as well as linear fractional programming problem.