IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v349y2025i3d10.1007_s10479-025-06617-5.html
   My bibliography  Save this article

Column-and-constraint generation approach to partition-based risk-averse two-stage stochastic programs

Author

Listed:
  • Jongheon Lee

    (Incheon National University)

  • Kyungsik Lee

    (Seoul National University)

Abstract

Typically, two-stage stochastic programs have been modeled and solved based on the finite support assumption, but the large number of scenarios makes it hard to solve, and there also are potential risks of inaccurate estimation of underlying distribution. In this paper, to mitigate the drawbacks, we present a novel risk-averse two-stage stochastic program with finite support, which we call partition-based risk-averse two-stage stochastic program. In the program, a set of scenarios is partitioned into several groups, and the second-stage cost is defined as the expectation of risk levels for all of the groups. In particular, the conditional value-at-risk is considered as a risk measure for each group, and so the risk level of the model is affected by a quantile parameter or a partition of a given set of scenarios. In order to solve the model exactly for a given partition, a column-and-constraint generation algorithm is proposed. In addition, a scenario partitioning algorithm to enable the risk level of the model to be close to a given target is devised, and partitioning schemes for combining it with the proposed column-and-constraint generation algorithm are proposed. Extensive numerical experiments were performed that demonstrated the effectiveness of the proposed partitioning schemes and the efficiency of the proposed solution approach.

Suggested Citation

  • Jongheon Lee & Kyungsik Lee, 2025. "Column-and-constraint generation approach to partition-based risk-averse two-stage stochastic programs," Annals of Operations Research, Springer, vol. 349(3), pages 1717-1747, June.
  • Handle: RePEc:spr:annopr:v:349:y:2025:i:3:d:10.1007_s10479-025-06617-5
    DOI: 10.1007/s10479-025-06617-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-025-06617-5
    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-025-06617-5?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:349:y:2025:i:3:d:10.1007_s10479-025-06617-5. 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.