On the convergence of successive approximations in dynamic programming with non-zero terminal reward
From MaRDI portal
Publication:3902861
DOI10.1007/BF01920049zbMath0454.90087OpenAlexW1993530147MaRDI QIDQ3902861
Publication date: 1981
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01920049
convergencesuccessive approximationsconvergence conditionsqueueing controlinfinite-horizon optimal value functionnon-zero terminal reward
Related Items
Optimal assignment policy of a single server attended by two queues, Markov renewal decision processes with finite horizon, Control of arrivals to two queues in series
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov programming by successive approximations with respect to weighted supremum norms
- A simple condition for regularity in negative programming
- Socially and Individually Optimal Control of Arrivals to a GI/M/1 Queue
- Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
- Discounted Dynamic Programming
- Negative Dynamic Programming
- Contraction Mappings in the Theory Underlying Dynamic Programming