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

Technical Note—Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems

Author

Listed:
  • Denis C. Onyekwelu

    (University of Benin, Benin City, Nigeria)

Abstract

We present the results of a computational evaluation of two constraint aggregation approaches for solving integer linear programs. In some applications, particularly set partitioning problems, the schemes can aggregate significantly different number of constraints. We first discuss the implementation of these approaches using both single and multiple precision arithmetic. From these results, we empirically show that, in practical implementation and evaluation of an aggregation scheme, the degree of difficulty encountered in solving the resulting equality constrained knapsack problem is crucial. We conclude, as contrasted with the optimism expressed in some published works, that the aggregation approach has limited value for solving general integer linear programs, but may be useful in developing a heuristic algorithm for the set partitioning problem.

Suggested Citation

  • Denis C. Onyekwelu, 1983. "Technical Note—Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems," Operations Research, INFORMS, vol. 31(4), pages 795-801, August.
    • Handle: RePEc:inm:oropre:v:31:y:1983:i:4:p:795-801
    DOI: 10.1287/opre.31.4.795
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.31.4.795
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.31.4.795?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
    ---><---

    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:31:y:1983:i:4:p:795-801. 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.