Sensitivity Analysis for Branch and Bound Integer Programming

After an integer program is solved, we may be interested in the effect of small changes in the right-hand side or objective function coefficients. Without modifying the underlying branch and bound or cutting plane algorithm, we show what additional data to collect during the solution of the original integer program to give useful bounds on the solution of the modified problem.