论文部分内容阅读
We use the information relaxation technique to develop a primaldual iterative approach to solve stochastic dynamic programming problems.In each iteration,we obtain confidence intervals for the optimal value so that we can assess the quality of the currently used policy.We show the method will converge to the true value in finite number of iterations.