Technical Note—Undiscounted Markov Renewal Programming Via Modified Successive Approximations

DOI10.1287/opre.19.4.1081zbMath0219.90050OpenAlexW2121251438MaRDI QIDQ5624999

Thomas E. Morton

Publication date: 1971

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.19.4.1081

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (5)

On theory and algorithms for Markov decision problems with the total reward criterion ⋮ The method of value oriented successive approximations for the average reward Markov decision process ⋮ A value iteration method for undiscounted multichain Markov decision processes ⋮ Improved iterative computation of the expected discounted return in Markov and semi-Markov chains ⋮ A \(K\)-step look-ahead analysis of value iteration algorithms for Markov decision processes

This page was built for publication: Technical Note—Undiscounted Markov Renewal Programming Via Modified Successive Approximations