Scenario decomposition of risk-averse multistage stochastic programming problems
From MaRDI portal
Publication:1931651
DOI10.1007/s10479-011-0935-yzbMath1255.90086OpenAlexW2072235407MaRDI QIDQ1931651
Ricardo A. Collado, David Papp, Ruszczyński, Andrzej
Publication date: 15 January 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0935-y
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (19)
A combined SDDP/Benders decomposition approach with a risk-averse surface concept for reservoir operation in long term power generation planning ⋮ Risk aversion in multistage stochastic programming: a modeling and algorithmic perspective ⋮ A quantitative comparison of risk measures ⋮ Constructing branching trees of geostatistical simulations ⋮ Index policy for multiarmed bandit problem with dynamic risk measures ⋮ Scenario decomposable subgradient projection method for two-stage stochastic programming with convex risk measures ⋮ Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs ⋮ A unified framework for stochastic optimization ⋮ Time-consistent, risk-averse dynamic pricing ⋮ Risk-averse model predictive control ⋮ Risk-averse stochastic path detection ⋮ Bounds on risk-averse mixed-integer multi-stage stochastic programming problems with mean-CVaR ⋮ Risk management for forestry planning under uncertainty in demand and prices ⋮ Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization ⋮ Multilevel Optimization Modeling for Risk-Averse Stochastic Programming ⋮ Time-consistent approximations of risk-averse multistage stochastic optimization problems ⋮ Decomposition Algorithms for Risk-Averse Multistage Stochastic Programs with Application to Water Allocation under Uncertainty ⋮ Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs ⋮ Decision tree analysis for a risk averse decision maker: CVaR criterion
Cites Work
- Risk-averse dynamic programming for Markov decision processes
- Dynamic monetary risk measures for bounded discrete-time processes
- A multicut algorithm for two-stage stochastic linear programs
- Stochastic linear programming. Models, theory, and computation
- Methods of descent for nondifferentiable optimization
- Coherent multiperiod risk adjusted values and Bellman's principle
- Dynamic coherent risk measures
- Generalized deviations in risk analysis
- Coherent Measures of Risk
- Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and Decomposition
- An aggregate subgradient method for nonsmooth convex minimization
- RISK MEASURES AND CAPITAL REQUIREMENTS FOR PROCESSES
- Lectures on Stochastic Programming
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- Introduction to Stochastic Programming
- A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
- Optimization of Convex Risk Functions
- Conditional Risk Mappings
- Set-valued analysis
- Stochastic finance. An introduction in discrete time
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Scenario decomposition of risk-averse multistage stochastic programming problems
