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

Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts

Author

Listed:
  • Kaj Holmberg

    (Linköping Institute of Technology, Linköping, Sweden)

Abstract

We study the lower bounds on the optimal objective function value of linear pure integer programming problems obtainable by the convexification in parts that results from using Benders' or cross decomposition, and the best lower bounds obtainable by the convexification resulting from Lagrangian relaxation together with subgradient optimization or Dantzig-Wolfe decomposition. A comparison shows that generalized Benders' and generalized cross decomposition yield the best of these bounds, while ordinary Benders' decomposition yields bounds that are sometimes better and sometimes worse than those of Lagrangian relaxation. However, cross decomposition can be used to automatically get the best of the two bounds. The conclusion of this paper is that cross decomposition can be useful for getting good lower bounds for pure integer programming problems, bounds that can be made better than those of the frequently used Lagrangian relaxation.

Suggested Citation

  • Kaj Holmberg, 1994. "Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts," Operations Research, INFORMS, vol. 42(4), pages 657-668, August.
    • Handle: RePEc:inm:oropre:v:42:y:1994:i:4:p:657-668
    DOI: 10.1287/opre.42.4.657
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.42.4.657
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.42.4.657?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. Holmberg, Kaj, 1997. "Mean value cross decomposition applied to integer programming problems," European Journal of Operational Research, Elsevier, vol. 97(1), pages 124-138, February.
    2. Santiago Cerisola & Álvaro Baíllo & José M. Fernández-López & Andrés Ramos & Ralf Gollmer, 2009. "Stochastic Power Generation Unit Commitment in Electricity Markets: A Novel Formulation and a Comparison of Solution Methods," Operations Research, INFORMS, vol. 57(1), pages 32-46, February.
    3. Yuceer, Umit, 1997. "A multi-product loading problem: a model and solution method," European Journal of Operational Research, Elsevier, vol. 101(3), pages 519-531, September.

    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:42:y:1994:i:4:p:657-668. 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.