Binary Integer Programming - Exploring the 0 Branch Previous Next
Once again, the above (highlighted) noninteger optimal solution for the LP-relaxation of the current () subproblem prevents us from fathoming. This completes Iteration 1. Since there are two unfathomed subproblems, and they were created simultaneously, we begin Iteration 2 by selecting the one with the better objective value (the  subproblem) from which to branch. This is done by selecting the node "x1 = 1" and branching on variable .