IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v12y1964i1p122-138.html
   My bibliography  Save this article

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

Author

Listed:
  • W. C. Healy

    (Marathon Oil Company, Findlay, Ohio)

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.

Suggested Citation

  • W. C. Healy, 1964. "Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)," Operations Research, INFORMS, vol. 12(1), pages 122-138, February.
    • Handle: RePEc:inm:oropre:v:12:y:1964:i:1:p:122-138
    DOI: 10.1287/opre.12.1.122
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.12.1.122
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.12.1.122?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sonia Singh & Shalabh Singh, 2018. "Bi-criteria transportation problem with multiple parameters," Annals of Operations Research, Springer, vol. 269(1), pages 667-692, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:12:y:1964:i:1:p:122-138. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.