zbMATH — the first resource for mathematics

Iterative solution of the functional equations of undiscounted Markov renewal programming. (English) Zbl 0218.90070

90C40 Markov and semi-Markov decision processes
60K15 Markov renewal processes, semi-Markov processes
Full Text: DOI
[1] Jewell, W.S; Jewell, W.S, Markov-renewal programming: II, Operations res., Operations res., 11, 949-971, (1963) · Zbl 0166.15602
[2] DeCani, J.S, A dynamic programming algorithm for embedded Markov chains when the planning horizon is at infinity, Management sci., 10, 716-733, (1964) · Zbl 0995.90622
[3] Howard, R.A, Research in semi-Markovian decision structures, Journal of the operations research society of Japan, 6, 169-199, (1964)
[4] Schweitzer, P.J, Perturbation theory and Markovian decision processes, M.I.T. operations research center technical report no. 15, (1965)
[5] Schweitzer, P.J, Perturbation theory and undiscounted Markov renewal programming, Operations res., 17, 716-727, (1969) · Zbl 0176.50003
[6] Osaki, S; Mine, H, Linear programming algorithms for semi-Markovian decision processes, J. math. anal. appl., 22, 356-381, (1968) · Zbl 0182.53203
[7] Denardo, E.V; Fox, B.L, Multichain Markov renewal programs, SIAM J. appl. math., 16, 468-487, (1968) · Zbl 0201.19303
[8] Morton, T.E, A critique of the norman-white dynamic programming approximation, Operations res., 17, 751-753, (1969) · Zbl 0176.50001
[9] White, D.J, Dynamic programming, Markov chains, and the method of successive approximations, J. math. anal. appl., 6, 373-376, (1963) · Zbl 0124.36404
[10] {\scP. J. Schweitzer}, Data Transformations for Markovian Decision Processes, to appear in Management Science.
[11] Odoni, A, On finding the maximal gain for Markov decision processes, Operations res., 17, 857-860, (1969) · Zbl 0184.23202
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.