On the Value of Risk-Averse Multistage Stochastic Programming in Capacity Planning
Xian Yu, Siqian Shen

TL;DR
This paper investigates the benefits of multistage risk-averse stochastic programming in capacity planning under uncertainty, providing bounds, guidelines, and algorithms to compare multistage and two-stage approaches.
Contribution
It introduces analytical bounds and approximation algorithms for risk-averse multistage capacity planning, and offers insights on when to prefer multistage over two-stage models.
Findings
Gaps increase with higher uncertainty variability.
Gaps decrease with increased risk aversion.
Stagewise-dependent scenarios lead to larger gaps.
Abstract
We consider a risk-averse stochastic capacity planning problem under uncertain demand in each period. Using a scenario tree representation of the uncertainty, we formulate a multistage stochastic integer program to adjust the capacity expansion plan dynamically as more information on the uncertainty is revealed. Specifically, in each stage, a decision maker optimizes capacity acquisition and resource allocation to minimize certain risk measures of maintenance and operational cost. We compare it with a two-stage approach that determines the capacity acquisition for all the periods up front. Using expected conditional risk measures (ECRMs), we derive a tight lower bound and an upper bound for the gaps between the optimal objective values of risk-averse multistage models and their two-stage counterparts. Based on these derived bounds, we present general guidelines on when to solve…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
