An algorithm for solving integer linear fractional programs

The objective of the analysis presented in this paper is to propose an algoithm for solving the integer linear fractional programs. This algorithm is based mainly on finding the smallest polyhedral set that contains all the feasible integer points in the solution space of these programs. It will be shown that these programs can be reduced to linear programs which can be solved easily using the simplex method. An illustrative simple example is given to demonstrate the proposed algorithm.