Branch and Bound Demonstration
Iteration - 1




The first solution display shows the linear programming relaxation without any restrictions. The solution objective value gives an upper bound on the value for the optimum integer solution.

The tree shows only the top vertex of the tree, indexed 1. The top vertex is at level 0.

The action for this first iteration is to branch on X6, the variable with the largest fractional value. Since its value is closer to 2 than to 1, we first restrict the solution by placing a lower bound of 2 on X6.