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

Consistency Cuts for Dantzig-Wolfe Reformulations

Author

Listed:
  • Jens Vinther Clausen

    (Department of Technology, Management, and Economics, Technical University of Denmark, Kongens Lyngby DK-2800, Denmark)

  • Richard Lusby

    (Department of Technology, Management, and Economics, Technical University of Denmark, Kongens Lyngby DK-2800, Denmark)

  • Stefan Ropke

    (Department of Technology, Management, and Economics, Technical University of Denmark, Kongens Lyngby DK-2800, Denmark)

Abstract

This paper introduces a family of valid inequalities, which we term consistency cuts, to be applied to a Dantzig-Wolfe reformulation (or decomposition) with linking variables. We prove that these cuts ensure an integer solution to the corresponding Dantzig-Wolfe relaxation when certain criteria to the structure of the decomposition are met. We implement the cuts and use them to solve a commonly used test set of 200 instances of the temporal knapsack problem. We assess the performance with and without the cuts and compare further to CPLEX and other solution methods that have historically been used to solve the test set. By separating consistency cuts, we show that we can obtain optimal integer solutions much faster than the other methods and even solve the remaining unsolved problems in the test set. We also perform a second test on instances from the MIPLIB 2017 online library of mixed-integer programs, showing the potential of the cuts on a wider range of problems.

Suggested Citation

  • Jens Vinther Clausen & Richard Lusby & Stefan Ropke, 2022. "Consistency Cuts for Dantzig-Wolfe Reformulations," Operations Research, INFORMS, vol. 70(5), pages 2883-2905, September.
    • Handle: RePEc:inm:oropre:v:70:y:2022:i:5:p:2883-2905
    DOI: 10.1287/opre.2021.2160
    as

    Download full text from publisher

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

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:70:y:2022:i:5:p:2883-2905. 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.