Solving Mixed Integer Programming Problems Using Automatic Reformulation

Tony J. Van Roy and Laurence A. Wolsey
Additional contact information
Tony J. Van Roy: Bank Brussels Lambert, Brussels, Belgium
Laurence A. Wolsey: Université Catholique de Louvain, Louvain-la-Neuve, Belgium

Operations Research, 1987, vol. 35, issue 1, 45-57

Abstract: In this paper we describe computational experience in solving mixed 0-1 programming problems using strong valid inequalities as cutting planes. In particular we report on the solution to optimality of 18 medium- to large-size problems, including production planning problems with setup costs and capacity constraints, multilevel distribution planning problems, drainage and heating system design problems, and electricity generator scheduling problems. The solution approach uses the theory of strong valid inequalities that we developed in a series of earlier papers. Here we report specifically on the implementation of an experimental system, MPSARX, which consists of the SCICONIC mathematical programming system and an automatic reformulation executor (ARX) that use this theory, and on the results obtained with this system.

Keywords: 482 fixed charge networks; 628 automatic reformulation with cutting planes; 631 facets of mixed integer programs (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (33)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.1.45 (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:oropre:v:35:y:1987:i:1:p:45-57

Access Statistics for this article

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