Infeasible path following alghorithm for linear fractional programming

Infeasible path following algorithm is one of the best alghorithm for solving semidefinite pro- gramming (semidefinite programming include linear programming, quadratic programming, second cone programming and etc.). infeasible path following algorithm is a interior point method but the sequence of answer is not feasible but this sequence convergence to a (optimal point) feasible point. We know linear fractional programming can be converted to linear programming. In this paper we convert a linear fractional programming to linear programming and then use infeasible path following algorithm for solving liear pro- gramming.