Branch and Bound Demonstration
Iteration - 7

Back

Iterations

 

At this level there is only one restriction. X6 is bounded from above by 1. The underline at level 1 of the tree shows that both alternatives at level 1 have been considered. Since the objective value is greater than the incumbent, we branch by setting the upper bound of X5 to 0.


LP


 
Tree

 
Action