Integer Programming Post-Optimal Analysis with Cutting Planes
- 1 January 1979
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 25 (1) , 64-72
- https://doi.org/10.1287/mnsc.25.1.64
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: