.png){kind=icon}
返回
Approximation of multistage stochastic programming problems by smoothed quantization
.png){kind=icon}
OA
AI
DOI：10.1007/s11846-024-00733-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present an approximation technique for solving multistage stochastic programming problems with an underlying Markov stochastic process. This process is approximated by a discrete skeleton process, which is consequently smoothed down by means of the original unconditional distribution. Approximated in this way, the problem is solvable by means of Markov Stochastic Dual Dynamic Programming. We state an upper bound for the nested distance between the exact process and its approximation and discuss its convergence in the one-dimensional case. We further propose an adjustment of the approximation, which guarantees that the approximate problem is bounded. Finally, we apply our technique to a real-life production-emission trading problem and demonstrate the performance of its approximation given the true distribution of the random parameters.
Keyword:
Multistage stochastic programming
Approximation
Markov dependence
SDDP
C61
期刊
IF:
12.4
论文数:
1.3K
被引数:
4.4K
机构
引用论文
Isolation and characterization of a human colon adenocarcinoma cell line resistant to doxorubicinOAAI
.png){kind=icon}
OAAI分享收藏
分享收藏
查看更多内容