Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)

W. C. Healy
Additional contact information
W. C. Healy: Marathon Oil Company, Findlay, Ohio

Operations Research, 1964, vol. 12, issue 1, 122-138

Abstract: A new procedure for mixed integer programming is presented. It is applicable where the integer variables must be either zero or one, and where the integer variables are divided into sets such that the variables in each set sum to unity. Numerous practical applications fit this formulation. A justification for the algorithm is given, but proof of convergence is not known. The procedure has solved all test problems so far, and this computational experience is discussed along with some applications.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.12.1.122 (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:12:y:1964:i:1:p:122-138

Access Statistics for this article

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