Binary Integer Programming - LP Relaxation Previous Next
For the Initialization step, the above optimal solution (obtained by the simplex method) for the LP-relaxation of the whole problem is examined to see if this problem can be fathomed by any of the fathoming tests. It cannot (the solution is non-integer, etc.), so the next step in the algorithm is to branch on the first variable .