The Expected loss in the discretization of multistage stochastic programming problems—estimation and convergence rate

    loading  Checking for direct PDF access through Ovid

Abstract

In the present paper, the approximate computation of a multistage stochastic programming problem (MSSPP) is studied. First, the MSSPP and its discretization are defined. Second, the expected loss caused by the usage of the “approximate” solution instead of the “exact” one is studied. Third, new results concerning approximate computation of expectations are presented. Finally, the main results of the paper—an upper bound of the expected loss and an estimate of the convergence rate of the expected loss—are stated.

Related Topics

    loading  Loading Related Articles