Abstract
A new scheme to cope with two-stage stochastic optimization problems uses a risk measure as the objective function of the recourse action, where the risk measure is defined as the worst-case expected values over a set of constrained distributions. This paper develops an approach to deal with the case where both the first and second stage objective functions are convex linear-quadratic. It is shown that under a standard set of regularity assumptions, this two-stage quadratic stochastic optimization problem with measures of risk is equivalent to a conic optimization problem that can be solved in polynomial time.
Original language | English |
---|---|
Pages (from-to) | 599-613 |
Number of pages | 15 |
Journal | Mathematical Programming |
Volume | 168 |
Issue number | 1-2 |
Early online date | 4 Mar 2017 |
DOIs | |
Publication status | Published - Mar 2018 |
Scopus Subject Areas
- Software
- General Mathematics
User-Defined Keywords
- Conic duality
- Quadratic programs
- Risk measures
- Stochastic optimization