Accelerated procedures for the solution of discrete Markov control problems

Accelerated procedures for computing optimal controls for a Markov chain model are discussed and numerical results are presented. For the example, one of the methods described gave a ten-fold decrease in computation time over a more usual procedure of dynamic programming.