An algorithm for biobjective integer linear programming problem

Abstract

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