期刊
OPERATIONS RESEARCH LETTERS
卷 36, 期 4, 页码 450-455出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2008.01.013
关键词
multistage stochastic programming; Monte-Carlo sampling; Benders decomposition
We discuss the almost-sure convergence of a broad class of sampling algorithms for multistage stochastic linear programs. We provide a convergence proof based on the finiteness of the set of distinct cut coefficients. This differs from existing published proofs in that it does not require a restrictive assumption. (C) 2008 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据