Integer Programming Post-Optimal Analysis with Cutting Planes

Dieter Klein and Sören Holm
Additional contact information
Dieter Klein: Florida International University
Sören Holm: Odense University

Management Science, 1979, vol. 25, issue 1, 64-72

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: programming: integer algorithms; cutting planes (search for similar items in EconPapers)
Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.25.1.64 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:25:y:1979:i:1:p:64-72

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().