Abstract.
We discuss in this paper statistical inference of sample average approximations of multistage stochastic programming problems. We show that any random sampling scheme provides a valid statistical lower bound for the optimal (minimum) value of the true problem. However, in order for such lower bound to be consistent one needs to employ the conditional sampling procedure. We also indicate that fixing a feasible first-stage solution and then solving the sampling approximation of the corresponding (T−1)-stage problem, does not give a valid statistical upper bound for the optimal value of the true problem.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Supported, in part, by the National Science Foundation under grant DMS-0073770.
Rights and permissions
About this article
Cite this article
Shapiro, A. Inference of statistical bounds for multistage stochastic programming problems. Math Meth Oper Res 58, 57–68 (2003). https://doi.org/10.1007/s001860300280
Issue Date:
DOI: https://doi.org/10.1007/s001860300280