Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models

Ellis L. Johnson, Michael M. Kostreva and Uwe H. Suhl
Additional contact information
Ellis L. Johnson: IBM Thomas J. Watson Research Center, Yorktown Heights, New York
Michael M. Kostreva: GM Research Laboratories, Warren, Michigan
Uwe H. Suhl: IBM Thomas J. Watson Research Center, Yorktown Heights, New York

Operations Research, 1985, vol. 33, issue 4, 803-819

Abstract: We present methods that are useful in solving some large scale hierarchical planning models involving 0-1 variables. These 0-1 programming problems initially could not be solved with any standard techniques. We employed several approaches to take advantage of the hierarchical structure of variables (ordered by importance) and other structures present in the models. Critical, but not sufficient for success, was a strong linear programming formulation. We describe methods for strengthening the linear programs, as well as other techniques necessary for a commercial branch-and-bound code to be successful in solving these problems.

Keywords: 181 planning models; 625 integer programming algorithms (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.4.803 (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:33:y:1985:i:4:p:803-819

Access Statistics for this article

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