Problem-driven scenario generation: an analytical approach for stochastic programs with tail risk measure
From MaRDI portal
Publication:2118074
Abstract: Scenario generation is the construction of a discrete random vector to represent parameters of uncertain values in a stochastic program. Most approaches to scenario generation are distribution-driven, that is, they attempt to construct a random vector which captures well in a probabilistic sense the uncertainty. On the other hand, a problem-driven approach may be able to exploit the structure of a problem to provide a more concise representation of the uncertainty. In this paper we propose an analytic approach to problem-driven scenario generation. This approach applies to stochastic programs where a tail risk measure, such as conditional value-at-risk, is applied to a loss function. Since tail risk measures only depend on the upper tail of a distribution, standard methods of scenario generation, which typically spread their scenarios evenly across the support of the random vector, struggle to adequately represent tail risk. Our scenario generation approach works by targeting the construction of scenarios in areas of the distribution corresponding to the tails of the loss distributions. We provide conditions under which our approach is consistent with sampling, and as proof-of-concept demonstrate how our approach could be applied to two classes of problem, namely network design and portfolio selection. Numerical tests on the portfolio selection problem demonstrate that our approach yields better and more stable solutions compared to standard Monte Carlo sampling.
Recommendations
- Problem-based optimal scenario generation and reduction in stochastic programming
- Scenario reduction for stochastic programs with conditional value-at-risk
- An empirical analysis of scenario generation methods for stochastic optimization
- Evaluation of scenario generation methods for stochastic programming
- Scenario generation with distribution functions and correlations
Cites work
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- scientific article; zbMATH DE number 3257962 (Why is no real title available?)
- A stochastic programming approach for supply chain network design under uncertainty
- Approximation Theorems of Mathematical Statistics
- Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming
- Chance-constrained problems and rare events: an importance sampling approach
- Coherent measures of risk
- Distributionally Robust Convex Optimization
- Dual Stochastic Dominance and Related Mean-Risk Models
- Evaluating policies in risk-averse multi-stage stochastic programming
- Expected shortfall and beyond
- Introduction to Stochastic Programming
- Iterative scenario based reduction technique for stochastic optimization using conditional value-at-risk
- JuMP: a modeling language for mathematical optimization
- Lectures on Stochastic Programming
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the projection onto a finitely generated cone
- Parallel processors for planning under uncertainty
- Robustness to dependency in portfolio optimization using overlapping marginals
- Scenario Generation for Single-Period Portfolio Selection Problems with Tail Risk Measures: Coping with High Dimensions and Integer Variables
- Scenario reduction in stochastic programming
- Scenario tree generation for multiperiod financial optimization of optimal discretization
- Scenario tree reduction for multistage stochastic programs
- The empirical behavior of sampling methods for stochastic programming
- Uncertainties in minimax stochastic programs
- Variance Reduction and Objective Function Evaluation in Stochastic Linear Programs
Cited in
(5)- Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective
- Effective scenarios in multistage distributionally robust optimization with a focus on total variation distance
- Scenario generation for stochastic programming and simulation: a modelling perspective
- Efficient Scenario Generation for Heavy-Tailed Chance Constrained Optimization
- A stabilised Benders decomposition with adaptive oracles for large-scale stochastic programming with short-term and long-term uncertainty
This page was built for publication: Problem-driven scenario generation: an analytical approach for stochastic programs with tail risk measure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118074)
