IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v288y2021i1p194-206.html
   My bibliography  Save this article

Constraint generation for risk averse two-stage stochastic programs

Author

Listed:
  • Mínguez, R.
  • van Ackooij, W.
  • García-Bertrand, R.

Abstract

A significant share of stochastic optimization problems in practice can be cast as two-stage stochastic programs. If uncertainty is available through a finite set of scenarios, which frequently occurs, and we are interested in accounting for risk aversion, the expectation in the recourse cost can be replaced with a worst-case function (i.e., robust optimization) or another risk-functional, such as conditional value-at-risk. In this paper we are interested in the latter situation especially when the number of scenarios is large. For computational efficiency we suggest a (clustering and) constraint generation algorithm. We establish convergence of these two algorithms and demonstrate their effectiveness through various numerical experiments.

Suggested Citation

  • Mínguez, R. & van Ackooij, W. & García-Bertrand, R., 2021. "Constraint generation for risk averse two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 288(1), pages 194-206.
    • Handle: RePEc:eee:ejores:v:288:y:2021:i:1:p:194-206
    DOI: 10.1016/j.ejor.2020.05.064
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720305257
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2020.05.064?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. Alexandra Künzi-Bay & János Mayer, 2006. "Computational aspects of minimizing conditional value-at-risk," Computational Management Science, Springer, vol. 3(1), pages 3-27, January.
    2. S. E. Wright, 1994. "Primal-Dual Aggregation and Disaggregation for Stochastic Linear Programs," Mathematics of Operations Research, INFORMS, vol. 19(4), pages 893-908, November.
    3. W. Ackooij & I. Danti Lopez & A. Frangioni & F. Lacalandra & M. Tahanan, 2018. "Large-scale unit commitment under uncertainty: an updated literature survey," Annals of Operations Research, Springer, vol. 271(1), pages 11-85, December.
    4. Wolf, Christian & Fábián, Csaba I. & Koberstein, Achim & Suhl, Leena, 2014. "Applying oracles of on-demand accuracy in two-stage stochastic programming – A computational study," European Journal of Operational Research, Elsevier, vol. 239(2), pages 437-448.
    5. Wim Ackooij, 2017. "A comparison of four approaches from stochastic programming for large-scale unit-commitment," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(1), pages 119-147, March.
    6. Wim Ackooij & Welington Oliveira, 2014. "Level bundle methods for constrained convex optimization with various oracles," Computational Optimization and Applications, Springer, vol. 57(3), pages 555-597, April.
    7. 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.
    8. René Henrion & Christian Küchler & Werner Römisch, 2009. "Scenario reduction in stochastic programming with respect to discrepancy distances," Computational Optimization and Applications, Springer, vol. 43(1), pages 67-93, May.
    9. Lemaréchal, C. & Nemirovskii, A. & Nesterov, Y., 1995. "New variants of bundle methods," LIDAM Reprints CORE 1166, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    10. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    11. Rockafellar, R. Tyrrell & Uryasev, Stanislav, 2002. "Conditional value-at-risk for general loss distributions," Journal of Banking & Finance, Elsevier, vol. 26(7), pages 1443-1471, July.
    12. Holger Heitsch & Werner Römisch, 2009. "Scenario tree reduction for multistage stochastic programs," Computational Management Science, Springer, vol. 6(2), pages 117-133, May.
    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. 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.
    2. Wim Ackooij & Welington Oliveira & Yongjia Song, 2019. "On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems," Computational Optimization and Applications, Springer, vol. 74(1), pages 1-42, September.
    3. Nasini, Stefano & Labbé, Martine & Brotcorne, Luce, 2022. "Multi-market portfolio optimization with conditional value at risk," European Journal of Operational Research, Elsevier, vol. 300(1), pages 350-365.
    4. Maciej Rysz & Alexander Vinel & Pavlo Krokhmal & Eduardo L. Pasiliao, 2015. "A Scenario Decomposition Algorithm for Stochastic Programming Problems with a Class of Downside Risk Measures," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 416-430, May.
    5. Fei, Xin & Gülpınar, Nalân & Branke, Jürgen, 2019. "Efficient solution selection for two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 277(3), pages 918-929.
    6. Blanchot, Xavier & Clautiaux, François & Detienne, Boris & Froger, Aurélien & Ruiz, Manuel, 2023. "The Benders by batch algorithm: Design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 309(1), pages 202-216.
    7. D. Kuhn, 2009. "Convergent Bounds for Stochastic Programs with Expected Value Constraints," Journal of Optimization Theory and Applications, Springer, vol. 141(3), pages 597-618, June.
    8. Kolos Ágoston, 2012. "CVaR minimization by the SRA algorithm," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(4), pages 623-632, December.
    9. Juan Ma & Foad Mahdavi Pajouh & Balabhaskar Balasundaram & Vladimir Boginski, 2016. "The Minimum Spanning k -Core Problem with Bounded CVaR Under Probabilistic Edge Failures," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 295-307, May.
    10. Ken Kobayashi & Yuichi Takano & Kazuhide Nakata, 2021. "Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 493-528, October.
    11. Welington Oliveira, 2019. "Proximal bundle methods for nonsmooth DC programming," Journal of Global Optimization, Springer, vol. 75(2), pages 523-563, October.
    12. Murwan Siddig & Yongjia Song, 2022. "Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse," Computational Optimization and Applications, Springer, vol. 81(1), pages 201-250, January.
    13. Yunmei Chen & Xiaojing Ye & Wei Zhang, 2020. "Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization," Computational Optimization and Applications, Springer, vol. 77(2), pages 411-432, November.
    14. Butyn, Emerson & Karas, Elizabeth W. & de Oliveira, Welington, 2022. "A derivative-free trust-region algorithm with copula-based models for probability maximization problems," European Journal of Operational Research, Elsevier, vol. 298(1), pages 59-75.
    15. Fernández, Elena & Hinojosa, Yolanda & Puerto, Justo & Saldanha-da-Gama, Francisco, 2019. "New algorithmic framework for conditional value at risk: Application to stochastic fixed-charge transportation," European Journal of Operational Research, Elsevier, vol. 277(1), pages 215-226.
    16. Escudero, Laureano F. & Monge, Juan F. & Rodríguez-Chía, Antonio M., 2020. "On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty," European Journal of Operational Research, Elsevier, vol. 287(1), pages 262-279.
    17. Ahmadi-Javid, Amir & Fallah-Tafti, Malihe, 2019. "Portfolio optimization with entropic value-at-risk," European Journal of Operational Research, Elsevier, vol. 279(1), pages 225-241.
    18. Pu Huang & Dharmashankar Subramanian, 2012. "Iterative estimation maximization for stochastic linear programs with conditional value-at-risk constraints," Computational Management Science, Springer, vol. 9(4), pages 441-458, November.
    19. Berend Roorda, 2010. "An algorithm for sequential tail value at risk for path-independent payoffs in a binomial tree," Annals of Operations Research, Springer, vol. 181(1), pages 463-483, December.
    20. F. W. Meng & J. Sun & M. Goh, 2010. "Stochastic Optimization Problems with CVaR Risk Measure and Their Sample Average Approximation," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 399-418, August.

    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:eee:ejores:v:288:y:2021:i:1:p:194-206. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.