IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v86y2023i3d10.1007_s10589-023-00532-w.html
   My bibliography  Save this article

A study of progressive hedging for stochastic integer programming

Author

Listed:
  • Jeffrey Christiansen

    (RMIT University)

  • Brian Dandurand

    (RMIT University)

  • Andrew Eberhard

    (RMIT University)

  • Fabricio Oliveira

    (Aalto University)

Abstract

Motivated by recent literature demonstrating the surprising effectiveness of the heuristic application of progressive hedging (PH) to stochastic mixed-integer programming (SMIP) problems, we provide theoretical support for the inclusion of integer variables, bridging the gap between theory and practice. We provide greater insight into the following observed phenomena of PH as applied to SMIP where optimal or at least feasible convergence is observed. We provide an analysis of a modified PH algorithm from a different viewpoint, drawing on the interleaving of (split) proximal-point methods (including PH), Gauss–Seidel methods, and the utilisation of variational analysis tools. Through this analysis, we show that under mild conditions, convergence to a feasible solution should be expected. In terms of convergence analysis, we provide two main contributions. First, we contribute insight into the convergence of proximal-point-like methods in the presence of integer variables via the introduction of the notion of persistent local minima. Secondly, we contribute an enhanced Gauss–Seidel convergence analysis that accommodates the variation of the objective function under mild assumptions. We provide a practical implementation of a modified PH and demonstrate its convergent behaviour with computational experiments in line with the provided analysis.

Suggested Citation

  • Jeffrey Christiansen & Brian Dandurand & Andrew Eberhard & Fabricio Oliveira, 2023. "A study of progressive hedging for stochastic integer programming," Computational Optimization and Applications, Springer, vol. 86(3), pages 989-1034, December.
    • Handle: RePEc:spr:coopap:v:86:y:2023:i:3:d:10.1007_s10589-023-00532-w
    DOI: 10.1007/s10589-023-00532-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-023-00532-w
    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/s10589-023-00532-w?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.

    References listed on IDEAS

    as
    1. Shabbir Ahmed & Renan Garcia, 2003. "Dynamic Capacity Acquisition and Assignment under Uncertainty," Annals of Operations Research, Springer, vol. 124(1), pages 267-283, November.
    2. P. Tseng, 2001. "Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization," Journal of Optimization Theory and Applications, Springer, vol. 109(3), pages 475-494, June.
    3. Fernando Veliz & Jean-Paul Watson & Andres Weintraub & Roger Wets & David Woodruff, 2015. "Stochastic optimization models in forest planning: a progressive hedging solution approach," Annals of Operations Research, Springer, vol. 232(1), pages 259-274, September.
    4. Jean-Paul Watson & David Woodruff, 2011. "Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems," Computational Management Science, Springer, vol. 8(4), pages 355-370, November.
    5. Marguerite Frank & Philip Wolfe, 1956. "An algorithm for quadratic programming," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 95-110, March.
    6. R. T. Rockafellar & Roger J.-B. Wets, 1991. "Scenarios and Policy Aggregation in Optimization Under Uncertainty," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 119-147, February.
    7. Fadaki, Masih & Abareshi, Ahmad & Far, Shaghayegh Maleki & Lee, Paul Tae-Woo, 2022. "Multi-period vaccine allocation model in a pandemic: A case study of COVID-19 in Australia," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    8. Shone, Rob & Glazebrook, Kevin & Zografos, Konstantinos G., 2021. "Applications of stochastic modeling in air traffic management: Methods, challenges and opportunities for solving air traffic problems under uncertainty," European Journal of Operational Research, Elsevier, vol. 292(1), pages 1-26.
    9. Luis Montero & Antonio Bello & Javier Reneses, 2022. "A Review on the Unit Commitment Problem: Approaches, Techniques, and Resolution Methods," Energies, MDPI, vol. 15(4), pages 1-40, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. William W. Hager & R. Tyrrell Rockafellar & Vladimir M. Veliov, 2023. "Preface to Asen L. Dontchev Memorial Special Issue," Computational Optimization and Applications, Springer, vol. 86(3), pages 795-800, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ilke Bakir & Natashia Boland & Brian Dandurand & Alan Erera, 2020. "Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 145-163, January.
    2. Hu, Shaolong & Han, Chuanfeng & Dong, Zhijie Sasha & Meng, Lingpeng, 2019. "A multi-stage stochastic programming model for relief distribution considering the state of road network," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 64-87.
    3. Bismark Singh & Bernard Knueven, 2021. "Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system," Journal of Global Optimization, Springer, vol. 80(4), pages 965-989, August.
    4. Lee, Jinkyu & Bae, Sanghyeon & Kim, Woo Chang & Lee, Yongjae, 2023. "Value function gradient learning for large-scale multistage stochastic programming problems," European Journal of Operational Research, Elsevier, vol. 308(1), pages 321-335.
    5. Wu, Dexiang & Wu, Desheng Dash, 2020. "A decision support approach for two-stage multi-objective index tracking using improved lagrangian decomposition," Omega, Elsevier, vol. 91(C).
    6. Kevin Ryan & Shabbir Ahmed & Santanu S. Dey & Deepak Rajan & Amelia Musselman & Jean-Paul Watson, 2020. "Optimization-Driven Scenario Grouping," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 805-821, July.
    7. Fan, Yingjie & Schwartz, Frank & Voß, Stefan, 2017. "Flexible supply chain planning based on variable transportation modes," International Journal of Production Economics, Elsevier, vol. 183(PC), pages 654-666.
    8. Gilles Bareilles & Yassine Laguel & Dmitry Grishchenko & Franck Iutzeler & Jérôme Malick, 2020. "Randomized Progressive Hedging methods for multi-stage stochastic programming," Annals of Operations Research, Springer, vol. 295(2), pages 535-560, December.
    9. Zhicheng Zhu & Yisha Xiang & Bo Zeng, 2021. "Multicomponent Maintenance Optimization: A Stochastic Programming Approach," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 898-914, July.
    10. Yongxi (Eric) Huang & Yueyue Fan & Chien-Wei Chen, 2014. "An Integrated Biofuel Supply Chain to Cope with Feedstock Seasonality and Uncertainty," Transportation Science, INFORMS, vol. 48(4), pages 540-554, November.
    11. Kazemi Zanjani, Masoumeh & Sanei Bajgiran, Omid & Nourelfath, Mustapha, 2016. "A hybrid scenario cluster decomposition algorithm for supply chain tactical planning under uncertainty," European Journal of Operational Research, Elsevier, vol. 252(2), pages 466-476.
    12. Fan, Yueyue & Huang, Yongxi & Chen, Chien-Wei, 2012. "Multistage Infrastructure System Design: An Integrated Biofuel Supply Chain against Feedstock Seasonality and Uncertainty," Institute of Transportation Studies, Working Paper Series qt9g8413m5, Institute of Transportation Studies, UC Davis.
    13. Cristian Camilo Marín-Cano & Juan Esteban Sierra-Aguilar & Jesús M. López-Lezama & Álvaro Jaramillo-Duque & Juan G. Villegas, 2020. "A Novel Strategy to Reduce Computational Burden of the Stochastic Security Constrained Unit Commitment Problem," Energies, MDPI, vol. 13(15), pages 1-19, July.
    14. Alonso-Ayuso, Antonio & Escudero, Laureano F. & Guignard, Monique & Weintraub, Andres, 2018. "Risk management for forestry planning under uncertainty in demand and prices," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1051-1074.
    15. Can Li & Ignacio E. Grossmann, 2019. "A finite $$\epsilon $$ϵ-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables," Journal of Global Optimization, Springer, vol. 75(4), pages 921-947, December.
    16. Nur Banu Demir & Serhat Gul & Melih Çelik, 2021. "A stochastic programming approach for chemotherapy appointment scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 68(1), pages 112-133, February.
    17. Fadda, Edoardo & Perboli, Guido & Tadei, Roberto, 2019. "A progressive hedging method for the optimization of social engagement and opportunistic IoT problems," European Journal of Operational Research, Elsevier, vol. 277(2), pages 643-652.
    18. Aghalari, Amin & Nur, Farjana & Marufuzzaman, Mohammad, 2021. "Solving a stochastic inland waterway port management problem using a parallelized hybrid decomposition algorithm," Omega, Elsevier, vol. 102(C).
    19. Huang, Zhouchun & Zheng, Qipeng Phil, 2020. "A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract," European Journal of Operational Research, Elsevier, vol. 287(3), pages 1036-1051.
    20. Sushil R. Poudel & Md Abdul Quddus & Mohammad Marufuzzaman & Linkan Bian & Reuben F. Burch V, 2019. "Managing congestion in a multi-modal transportation network under biomass supply uncertainty," Annals of Operations Research, Springer, vol. 273(1), pages 739-781, February.

    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:coopap:v:86:y:2023:i:3:d:10.1007_s10589-023-00532-w. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.