A Note on Branch and Bound Algorithm for Integer Linear Programming

In branch and bound algorithm for integer linear programming the usual approach is incorporating dual simplex method to achieve feasibility for each sub-problem. Although one can also employ the phase 1 simplex method but the simplicity and easy implementation of the dual simplex method bounds the users to use it. In this paper a new technique for handling sub-problems in branch and bound method has been presented, which is an efficient alternative of dual simplex method.