Relaxation Methods for Pure and Mixed Integer Programming Problems

G. Anthony Gorry, Jeremy F. Shapiro and Laurence A. Wolsey
Additional contact information
G. Anthony Gorry: Massachusetts Institute of Technology
Jeremy F. Shapiro: Massachusetts Institute of Technology
Laurence A. Wolsey: Manchester Business School, Manchester, England

Management Science, 1972, vol. 18, issue 5-Part-1, 229-239

Abstract: The usefulness of group theoretic methods in solving integer programming (IP) problems is extended by procedures for controlling the size of the groups. The main procedure given shows how an optimal linear programming basis can be altered to reduce the magnitude of its determinant thereby reducing the size of the group induced by the basis. An adaption of Benders' mixed IP algorithm is given which uses these methods. Some limited computational experience is given.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.5.229 (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:18:y:1972:i:5-part-1:p:229-239

Access Statistics for this article

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