An algorithm for soving ILP problems is given in this paper. According to the optimal simplex tableau of the associate LP，we transform ILP into an indeterminate equation with positive integer coefficients. We then choose a solution，which satisfies the constraint conditions of ILP，from the nonnegative integer solution set of the indeterminate equation as an optimal solution of ILP.