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

A Bounding Minimization Problem for Primal Integer Programming

Author

Listed:
  • Larry R. Arnold

    (Tulane University, New Orleans, Louisiana)

  • Mandell Bellmore

    (Block, McGibony and Associates, Inc., Silver Spring, Maryland)

Abstract

Computational experiments with the primal integer programming algorithm indicate that in many cases the optimal value of the objective function is obtained in a very few iterations but a large number of iterations are required to establish optimality; thus, an alternative proof of optimality is needed. This paper describes an algorithm for obtaining an upper bound (such an alternative) on the value of the objective function. This bound is based on the best bound obtainable from dual solutions to a class of related linear programs. Computational results illustrating the effectiveness of this bounding technique are presented.

Suggested Citation

  • Larry R. Arnold & Mandell Bellmore, 1974. "A Bounding Minimization Problem for Primal Integer Programming," Operations Research, INFORMS, vol. 22(2), pages 383-392, April.
    • Handle: RePEc:inm:oropre:v:22:y:1974:i:2:p:383-392
    DOI: 10.1287/opre.22.2.383
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.22.2.383
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.22.2.383?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:oropre:v:22:y:1974:i:2:p:383-392. 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.