IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v24y1977i3p312-319.html
   My bibliography  Save this article

A Modified Benders' Partitioning Algorithm for Mixed Integer Programming

Author

Listed:
  • Dale McDaniel

    (California State University at Northridge)

  • Mike Devine

    (University of Oklahoma)

Abstract

As applied to mixed-integer programming, Benders' original work made two primary contributions: (1) development of a "pure integer" problem (Problem P) that is equivalent to the original mixed-integer problem, and (2) a relaxation algorithm for solving Problem P that works iteratively on an LP problem and a "pure integer" problem. In this paper a modified algorithm for solving Problem P is proposed, in which the solution of a sequence of integer programs is replaced by the solution of a sequence of linear programs plus some (hopefully few) integer programs. The modified algorithm will still allow for taking advantage of any special structures (e.g., an LP subproblem that is a "network problem") just as in Benders' original algorithm. The modified Benders' algorithm is explained and limited computational results are given.

Suggested Citation

  • Dale McDaniel & Mike Devine, 1977. "A Modified Benders' Partitioning Algorithm for Mixed Integer Programming," Management Science, INFORMS, vol. 24(3), pages 312-319, November.
  • Handle: RePEc:inm:ormnsc:v:24:y:1977:i:3:p:312-319
    DOI: 10.1287/mnsc.24.3.312
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.24.3.312
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.24.3.312?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
    ---><---

    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:ormnsc:v:24:y:1977:i:3:p:312-319. 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.