Branch and Bound
Demonstration
Iteration - 10
Iterations
At the final iteration, the bounds are set to the optimum integer decisions. The LP solution for the optimum case is below. For this all integer problem, the lower and upper bounds are just the optimum values of the decision variables. For a mixed integer problem, this step is necessary to find the optimum values of the variables not constrained to be integer.
LP
Tree
Action
