IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-031-52464-6_7.html
   My bibliography  Save this book chapter

Mean-Risk Stochastic Linear Programming Methods

In: Computational Stochastic Programming

Author

Listed:
  • Lewis Ntaimo

    (Texas A&M University)

Abstract

In this chapter, we study decompositionDecomposition methods for mean-risk two-stage stochastic linear programming (MR-SLP). We use structural properties of MR-SLP derived in Chap. 2 and decomposition techniques from Chap. 6 to derive solution algorithms for MR-SLP for quantile and deviation risk measures. Definitions of risk measures and deterministic equivalent problem (DEP) formulations are derived in Chap. 2. The risk measures quantile deviation (QDEV), conditional value-at-risk (CVaR), and expected excess EE have DEPs with dual block angular structure amenable to Benders decompositionDecompositionBenders decomposition. Therefore, we derive an L-shaped algorithmL-shaped algorithm termed, 𝔻 $$\mathbb {D}$$ -AGG algorithm, for 𝔻 ∈ { QDEV, CVaR, EE } $$\mathbb {D} \in \{\text{QDEV, CVaR, EE}\}$$ involving a single (aggregated) optimality cutOptimality cut at each iteration of the algorithm in Sect. 7.2. This is followed by the derivation of the 𝔻 $$\mathbb {D}$$ -SEP algorithm in Sect. 7.3 involving two separate optimality cutsOptimality cut, one for the expectation term and the other for the quantile (deviation) term of the DEP objective function. For the remainder of the chapter, we turn to the derivation of two subgradient-based algorithms for the deviation risk measureRisk measure absolute semideviation (ASD), termed ASD-AGG and ASD-SEP algorithms. Unlike MR-SLP with QDEV, CVaR, and EE, the DEP for ASD has a block angular structure due to a set of linking constraintsLinking constraint. Therefore, the L-shaped method is not applicable in this case, and that is why we consider a subgradient-based approach to tackle the problem. We derive the single optimality cutOptimality cut ASD-AGG algorithm in Sect. 7.4 and the separate optimality cut ASD-SEP algorithm in Sect. 7.5. Implementing (coding) algorithms for MR-SLP on a computer is not a trivial matter. Therefore, we include detailed numerical examples to illustrate the algorithms and provide some insights and guidelines for computer implementationComputer implementation.

Suggested Citation

  • Lewis Ntaimo, 2024. "Mean-Risk Stochastic Linear Programming Methods," Springer Optimization and Its Applications, in: Computational Stochastic Programming, chapter 0, pages 277-348, Springer.
  • Handle: RePEc:spr:spochp:978-3-031-52464-6_7
    DOI: 10.1007/978-3-031-52464-6_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    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:spochp:978-3-031-52464-6_7. 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.