In the present paper a bi-objective integer linear programming problem (BILP) is discussed. The main effort in this work is to effectively implement the ϵ-constraint method to produce a complete set of non dominated points. The convergence of the algorithm has been established theoretically. Further a comparative study to some existing algorithm has also been made.