Computational methodology for linear fractional transportation problem

Transportation engineering is one of the most popular area of Operations Research in which fractional programming is used. In this study, we present two algorithms to find initial basic feasible solution of a linear fractional transportation problem. Also we present a methodology to find optimal solution of the stated problem. Using simulation experiments on large number of examples we compare the results with other existing methods for finding initial solution and number of iteration to find optimal solution for linear fractional transportation problem (LFTP).