An optimal sequential policy for controlling a Markov renewal process

DOI10.2307/3213776MaRDI QIDQ3678998zbMATH OpenOpenAlexFDO

Authors J. M. McNamara

Publication date 1985

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3213776

zbMATH Keywords

long-term average rate of rewardMarkov process with continuation costoptimal sequential policyrenewal reward processesstopping problem

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Markov and semi-Markov decision processes (90C40) General biology and biomathematics (92B05)

Recommendations

• scientific article; zbMATH DE number 3845482
• Estimation and control in multichain processes
• scientific article; zbMATH DE number 3924660
• Policy Improvement and the Newton–Raphson Algorithm for Renewal Reward Processes
• scientific article; zbMATH DE number 3998936

Cited in

(5)

• Optimally designed renewal reward processes: General framework and applications
• scientific article; zbMATH DE number 3846623 (Why is no real title available?)
• Policy Improvement and the Newton–Raphson Algorithm for Renewal Reward Processes
• Optimal retrial policies for restrained markov chains
• Lagrangean Methods and Optimal Stopping

This page was built for publication: An optimal sequential policy for controlling a Markov renewal process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3678998)