Generalized decision rule approximations for stochastic programming via liftings
Stochastic programming provides a versatile framework for decision-making under uncertainty, but the resulting optimization problems can be computationally demanding. It has recently been shown that primal and dual linear decision rule approximations can yield tractable upper and lower bounds on the...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer Berlin Heidelberg,
2016-06-30T19:59:05Z.
|
| Subjects: | |
| Online Access: | Get fulltext |