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

A Method for Solving Discrete Optimization Problems

Author

Listed:
  • E. L. Lawler

    (The University of Michigan, Ann Arbor, Michigan)

  • M. D. Bell

    (The University of Michigan, Ann Arbor, Michigan)

Abstract

This paper describes a simple, easily-programmed method for solving discrete optimization problems with monotone objective functions and completely arbitrary (possibly nonconvex) constraints. The method is essentially one of partial enumeration, and is closely related to the “lexicographic” algorithm of Gilmore and Gomory for the “knapsack” problem and to the “additive” algorithm of Balas for the general integer linear programming problem. The results of a number of sample computations are reported. These indicate that the method is computationally feasible for problems in which the number of variables is fairly small.

Suggested Citation

  • E. L. Lawler & M. D. Bell, 1966. "A Method for Solving Discrete Optimization Problems," Operations Research, INFORMS, vol. 14(6), pages 1098-1112, December.
    • Handle: RePEc:inm:oropre:v:14:y:1966:i:6:p:1098-1112
    DOI: 10.1287/opre.14.6.1098
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.14.6.1098
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.14.6.1098?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. Mohammad Sabbagh & Richard Soland, 2009. "An improved partial enumeration algorithm for integer programming problems," Annals of Operations Research, Springer, vol. 166(1), pages 147-161, February.
    2. Abdul Basit & Saad Qaisar & Mudassar Ali & Muhammad Naeem & Marc Bruyere & Joel J. P. C. Rodrigues, 2020. "Interconnecting networks with optimized service provisioning," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 73(2), pages 223-239, February.

    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:14:y:1966:i:6:p:1098-1112. 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.