IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-02900862.html
   My bibliography  Save this paper

Multiplier Stabilization Applied to Two-Stage Stochastic Programs

Author

Listed:
  • Clara Lage

    (ENGIE E&P International [La Défense], CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique, UP1 - Université Paris 1 Panthéon-Sorbonne)

  • Claudia Sagastizábal

    (IMECC - Instituto de Matemática, Estatística e Computação Científica [Brésil] - UNICAMP - Universidade Estadual de Campinas = University of Campinas)

  • Mikhail Solodov

    (IMPA - Instituto Nacional de Matemática Pura e Aplicada)

Abstract

In many mathematical optimization applications dual variables are an important output of the solving process, due to their role as price signals. When dual solutions are not unique, different solvers or different computers, even different runs in the same computer if the problem is stochastic, often end up with different optimal multipliers. From the perspective of a decision maker, this variability makes the prices signals less reliable and, hence, less useful. We address this issue for a particular family of linear and quadratic programs by proposing a solution procedure that, among all possible optimal multipliers, systematically yields the one with the smallest norm. The approach, based on penalization techniques of nonlinear programming, amounts to a regularization in the dual of the original problem. As the penalty parameter tends to zero, convergence of the primal sequence and, more critically, of the dual is shown under natural assumptions. The methodology is illustrated on a battery of two-stage stochastic linear programs.

Suggested Citation

  • Clara Lage & Claudia Sagastizábal & Mikhail Solodov, 2020. "Multiplier Stabilization Applied to Two-Stage Stochastic Programs," Post-Print halshs-02900862, HAL.
    • Handle: RePEc:hal:journl:halshs-02900862
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-02900862
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-02900862/document
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Suvrajeet Sen & Yifan Liu, 2016. "Mitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction," Operations Research, INFORMS, vol. 64(6), pages 1422-1437, December.
    2. Wim Ackooij & Jérôme Malick, 2016. "Decomposition algorithm for large-scale two-stage unit-commitment," Annals of Operations Research, Springer, vol. 238(1), pages 587-613, March.
    3. Wim Ackooij & Jérôme Malick, 2016. "Decomposition algorithm for large-scale two-stage unit-commitment," Annals of Operations Research, Springer, vol. 238(1), pages 587-613, March.
    4. István Deák, 2006. "Two-stage stochastic problems with correlated normal variables: computational experiences," Annals of Operations Research, Springer, vol. 142(1), pages 79-97, February.
    5. Birge, John R. & Louveaux, Francois V., 1988. "A multicut algorithm for two-stage stochastic linear programs," European Journal of Operational Research, Elsevier, vol. 34(3), pages 384-392, March.
    Full references (including those not matched with items on IDEAS)

    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. Clara Lage & Claudia Sagastizábal & Mikhail Solodov, 2020. "Multiplier Stabilization Applied to Two-Stage Stochastic Programs," Documents de travail du Centre d'Economie de la Sorbonne 20010, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    2. Clara Lage & Claudia Sagastizábal & Mikhail Solodov, 2019. "Multiplier Stabilization Applied to Two-Stage Stochastic Programs," Journal of Optimization Theory and Applications, Springer, vol. 183(1), pages 158-178, October.
    3. Clara Lage & Claudia Sagastizábal & Mikhail Solodov, 2020. "Multiplier Stabilization Applied to Two-Stage Stochastic Programs," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-02900862, HAL.
    4. Alexander Franz & Julia Rieck & Jürgen Zimmermann, 2019. "Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages," Annals of Operations Research, Springer, vol. 274(1), pages 241-265, March.
    5. Wim van Ackooij & Welington de Oliveira & Yongjia Song, 2018. "Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 57-70, February.
    6. Pedro Borges, 2022. "Cut-sharing across trees and efficient sequential sampling for SDDP with uncertainty in the RHS," Computational Optimization and Applications, Springer, vol. 82(3), pages 617-647, July.
    7. W. Ackooij & X. Warin, 2020. "On conditional cuts for stochastic dual dynamic programming," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 173-199, June.
    8. Wim Ackooij & Nicolas Lebbe & Jérôme Malick, 2017. "Regularized decomposition of large scale block-structured robust optimization problems," Computational Management Science, Springer, vol. 14(3), pages 393-421, July.
    9. W. Ackooij & A. Frangioni & W. Oliveira, 2016. "Inexact stabilized Benders’ decomposition approaches with application to chance-constrained problems with finite support," Computational Optimization and Applications, Springer, vol. 65(3), pages 637-669, December.
    10. A. Ruszczynski, 1993. "Regularized Decomposition of Stochastic Programs: Algorithmic Techniques and Numerical Results," Working Papers wp93021, International Institute for Applied Systems Analysis.
    11. Elisangela Martins de Sá & Ivan Contreras & Jean-François Cordeau & Ricardo Saraiva de Camargo & Gilberto de Miranda, 2015. "The Hub Line Location Problem," Transportation Science, INFORMS, vol. 49(3), pages 500-518, August.
    12. Özgün Elçi & John Hooker, 2022. "Stochastic Planning and Scheduling with Logic-Based Benders Decomposition," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2428-2442, September.
    13. Wang, S. & Huang, G.H., 2014. "An integrated approach for water resources decision making under interactive and compound uncertainties," Omega, Elsevier, vol. 44(C), pages 32-40.
    14. Li, Y.P. & Huang, G.H. & Li, M.W., 2014. "An integrated optimization modeling approach for planning emission trading and clean-energy development under uncertainty," Renewable Energy, Elsevier, vol. 62(C), pages 31-46.
    15. A. Ruszczynski & A. Swietanowski, 1996. "On the Regularized Decomposition Method for Two Stage Stochastic Linear Problems," Working Papers wp96014, International Institute for Applied Systems Analysis.
    16. Ricardo Saraiva de Camargo & Gilberto de Miranda & Henrique Pacca L. Luna, 2009. "Benders Decomposition for Hub Location Problems with Economies of Scale," Transportation Science, INFORMS, vol. 43(1), pages 86-97, February.
    17. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2015. "Benders Decomposition for Production Routing Under Demand Uncertainty," Operations Research, INFORMS, vol. 63(4), pages 851-867, August.
    18. Riis, Morten & Andersen, Kim Allan, 2005. "Applying the minimax criterion in stochastic recourse programs," European Journal of Operational Research, Elsevier, vol. 165(3), pages 569-584, September.
    19. Jiajun Xu & Suvrajeet Sen, 2024. "Ensemble Variance Reduction Methods for Stochastic Mixed-Integer Programming and their Application to the Stochastic Facility Location Problem," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 587-599, March.
    20. Halit Üster & Sung Ook Hwang, 2017. "Closed-Loop Supply Chain Network Design Under Demand and Return Uncertainty," Transportation Science, INFORMS, vol. 51(4), pages 1063-1085, November.

    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:hal:journl:halshs-02900862. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.