Abstarct: In this thesis we consider the inverse of linear fractional programming . At first we consider the linear fractional programming and methods of Charens-Cooper and Dinkelbach for linearization this problem. In the inverse optimization we want to find a minimum adjustment of the parameters of the problem such that the given solution becomes optimum. In the must of methods for inverse linear programming the coefficient of objective function or right hand side are change to make a feasible solution optimum. We consider some of the methods and their extensions for linear fractional programming .