Correctness and Finite Termination of the Branch and Bound Algorithm for Integer Programming
Students frequently conflate the 'relaxation' with the actual integer constraint. Remember: the linear relaxation provides an optimistic upper bound (for maximization), but it is not the integer solution. Pruning only occurs if the relaxed bound cannot beat the incumbent integer solution.
Institutional Reference: Linear and Integer Programming
View Full Proof →