Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program

James C. Bean
Additional contact information
James C. Bean: The University of Michigan, Ann Arbor, Michigan

Operations Research, 1984, vol. 32, issue 5, 1185-1193

Abstract: In the Multiple Choice Integer Program, the binary variables are partitioned into generalized upper bounding sets (or special ordered sets). We solve this problem using a branch-and-bound scheme designed to take advantage of this structure. The basic procedure is enhanced by solving a Lagrangean problem as an approximation. Further, we use a variable reduction technique to eliminate many of the variables prior to problem solution. Computational experience is promising for randomly generated problems, scheduling problems, and budgeting problems tested.

Keywords: 626; and; 627; multiple; choice; problem (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.5.1185 (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:32:y:1984:i:5:p:1185-1193

Access Statistics for this article

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