Abstract
We study the problem of maximizing the sum of discounted rewards, earned not over a fixed number of periods, but until the decision process enters a given absorbing set. The basic theorem for absorbing DPs is derived. Moreover, we show how absorbing DPs can be used to find cost-minimal subpaths in acyclic networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Beckmann, M. J. (1968). Dynamic programming of economic decisions. New York: Springer.
Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269–271.
Dreyfus, S. E., & Law, A. M. (1977). The art and theory of dynamic programming. New York: Academic Press.
Gondran, M., & Minoux, M. (1984). Graphs and algorithms. Chichester: Wiley.
Jungnickel, D. (1987). On a theorem of Ganley. Graphs and Combinatorics, 3, 141–143.
Martello, S., & Toth, P. (1990). Knapsack problems. Chichester: Wiley.
Nemhauser, G. L., Rinnooy Kan, A. H. G., & Todd, M. J. (Eds.). (1989). Optimization (Handbooks in Operations Research and Management Science, Vol. 1). Amsterdam: North-Holland Publishing Co.
Nemhauser, G. L., & Wolsey, L. A. (1988). Integer and combinatorial optimization. New York: Wiley.
Neumann, K., & Morlock, M. (1993). Operations research. Munich: Carl Hanser Verlag.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this chapter
Cite this chapter
Hinderer, K., Rieder, U., Stieglitz, M. (2016). Absorbing Dynamic Programs and Acyclic Networks. In: Dynamic Optimization. Universitext. Springer, Cham. https://doi.org/10.1007/978-3-319-48814-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-48814-1_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48813-4
Online ISBN: 978-3-319-48814-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)