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

Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem

Author

Listed:
  • Gajendra K. Adil

    (Department of Mechanical and Industrial Engineering, University of Manitoba, Winnipeg, Canada)

  • Jay B. Ghosh

    (Faculty of Business Administration, Bilkent University, Ankara, Turkey)

Abstract

Recently, Ahmadi and Tang (1991) demonstrated how various manufacturing problems can be modeled and solved as graph partitioning problems. They use Lagrangian relaxation of two different mixed integer programming formulations to obtain both heuristic solutions and lower bounds on optimal solution values. In this note, we point to certain inconsistencies in the reported results. Among other things, we show analytically that the first bound proposed is trivial (i.e., it can never have a value greater than zero) while the second is also trivial for certain sparse graphs. We also present limited empirical results on the behavior of this second bound as a function of graph density.

Suggested Citation

  • Gajendra K. Adil & Jay B. Ghosh, 1999. "Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem," Operations Research, INFORMS, vol. 47(5), pages 785-788, October.
    • Handle: RePEc:inm:oropre:v:47:y:1999:i:5:p:785-788
    DOI: 10.1287/opre.47.5.785
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.47.5.785
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.47.5.785?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:47:y:1999:i:5:p:785-788. 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.