Integer Programming Post-Optimal Analysis with Cutting Planes

Sufficient conditions have been developed for testing the optimality of solutions to all-integer and mixed-integer linear programming problems after coefficient changes in the right hand side and the objective function, or after introduction of new variables. The same conditions can be used as necessary conditions for coefficient changes to alter an optimal solution. The tests are based on cutting-plane theory, and the application of the tests requires solution of the original integer problem with a cutting-plane algorithm.

• 저널Management Science · 25(1) · 64–72
• 토픽Optimization and Packing Problems · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.25.1.64
• 저자Dieter Klein, Søren Holm