Computational Methods for Controlled Markov Chains
The chapter presents many of the basic ideas which are in current use for the solution of the dynamic programming equations for the optimal control and value function for the approximating Markov chain models. We concentrate on methods for problems which are of interest over a potentially unbounded time interval. Numerical methods for the ergodic problem will be discussed in Chapter 7, and are simple modifications of the ideas of this chapter. Some approaches to the numerical problem for the finite time problem will be discussed in Chapter 12.
KeywordsCoarse Grid Domain Decomposition Multigrid Method Policy Space Basic Feasible Solution
Unable to display preview. Download preview PDF.