A new approach for integer linear programming is developed in this paper which is characterised mostly by the flexibility that the optimal integeral solution or a very close approximate solution can be obtained according to the need or the dimensions of the problem. The analysis and computational results have shown that the three-stage method has many advantages over the other algorithms available especially in convergent speed of solving large scale integer linear programming problems.