IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v333y2024i1d10.1007_s10479-023-05499-9.html
   My bibliography  Save this article

Survey on Lagrangian relaxation for MILP: importance, challenges, historical review, recent advancements, and opportunities

Author

Listed:
  • Mikhail A. Bragin

    (University of Connecticut)

Abstract

Operations in areas of importance to society are frequently modeled as mixed-integer linear programming (MILP) problems. While MILP problems suffer from combinatorial complexity, Lagrangian Relaxation has been a beacon of hope to resolve the associated difficulties through decomposition. Due to the non-smooth nature of Lagrangian dual functions, the coordination aspect of the method has posed serious challenges. This paper presents several significant historical milestones (beginning with Polyak’s pioneering work in 1967) toward improving Lagrangian Relaxation coordination through improved optimization of non-smooth functionals. Finally, this paper presents the most recent developments in Lagrangian Relaxation for fast resolution of MILP problems. The paper also briefly discusses the opportunities that Lagrangian Relaxation can provide at this point in time.

Suggested Citation

  • Mikhail A. Bragin, 2024. "Survey on Lagrangian relaxation for MILP: importance, challenges, historical review, recent advancements, and opportunities," Annals of Operations Research, Springer, vol. 333(1), pages 29-45, February.
    • Handle: RePEc:spr:annopr:v:333:y:2024:i:1:d:10.1007_s10479-023-05499-9
    DOI: 10.1007/s10479-023-05499-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05499-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-023-05499-9?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:annopr:v:333:y:2024:i:1:d:10.1007_s10479-023-05499-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.