Skip to main content
Top
Published in:
Cover of the book

2016 | OriginalPaper | Chapter

1. Introduction and Organization of the Book

Authors : Karl Hinderer, Ulrich Rieder, Michael Stieglitz

Published in: Dynamic Optimization

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this treatise we deal with optimization problems whose objective functions show a sequential structure and hence are amenable to sequential methods. The corresponding field mostly goes by the name Discrete-time Dynamic Programming. Other names are Discrete-time Stochastic Control and Multi-stage Optimization. In order to avoid possible confusion with programming in computer science we speak of Dynamic Optimization.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
go back to reference Altman, E. (1999). Constrained Markov decision processes (Stochastic Modeling). Boca Raton: Chapman & Hall/CRC.MATH Altman, E. (1999). Constrained Markov decision processes (Stochastic Modeling). Boca Raton: Chapman & Hall/CRC.MATH
go back to reference Bäuerle, N., & Rieder, U. (2011). Markov decision processes with applications to finance (Universitext). Heidelberg: Springer.CrossRefMATH Bäuerle, N., & Rieder, U. (2011). Markov decision processes with applications to finance (Universitext). Heidelberg: Springer.CrossRefMATH
go back to reference Bellman, R. (1957). Dynamic programming. Princeton: Princeton University Press.MATH Bellman, R. (1957). Dynamic programming. Princeton: Princeton University Press.MATH
go back to reference Bertsekas, D. P. (1975). Convergence of discretization procedures in dynamic programming. IEEE Transactions Automatic Control, AC-20, 415–419.MathSciNetCrossRefMATH Bertsekas, D. P. (1975). Convergence of discretization procedures in dynamic programming. IEEE Transactions Automatic Control, AC-20, 415–419.MathSciNetCrossRefMATH
go back to reference Bertsekas, D. P. (2001). Dynamic programming and optimal control (Vol. II, 2nd ed.). Belmont: Athena Scientific.MATH Bertsekas, D. P. (2001). Dynamic programming and optimal control (Vol. II, 2nd ed.). Belmont: Athena Scientific.MATH
go back to reference Bertsekas, D. P. (2005). Dynamic programming and optimal control (Vol. I, 3rd ed.). Belmont: Athena Scientific.MATH Bertsekas, D. P. (2005). Dynamic programming and optimal control (Vol. I, 3rd ed.). Belmont: Athena Scientific.MATH
go back to reference Bertsekas, D. P., & Shreve, S. E. (1979). Existence of optimal stationary policies in deterministic optimal control. Journal of Mathematical Analysis and Applications, 69, 607–620.MathSciNetCrossRefMATH Bertsekas, D. P., & Shreve, S. E. (1979). Existence of optimal stationary policies in deterministic optimal control. Journal of Mathematical Analysis and Applications, 69, 607–620.MathSciNetCrossRefMATH
go back to reference Chang, H. S., Fu, M. C., Hu, J., & Marcus, S. I. (2007). Simulation-based algorithms for Markov decision processes. London: Springer.CrossRefMATH Chang, H. S., Fu, M. C., Hu, J., & Marcus, S. I. (2007). Simulation-based algorithms for Markov decision processes. London: Springer.CrossRefMATH
go back to reference Dvoretzky, A., Kiefer, J., & Wolfowitz, J. (1952b). The inventory problem. II. Case of unknown distributions of demand. Econometrica, 20, 450–466.MathSciNetCrossRefMATH Dvoretzky, A., Kiefer, J., & Wolfowitz, J. (1952b). The inventory problem. II. Case of unknown distributions of demand. Econometrica, 20, 450–466.MathSciNetCrossRefMATH
go back to reference Dynkin, E. B., & Yushkevich, A. A. (1979). Controlled Markov processes. Berlin: Springer.CrossRefMATH Dynkin, E. B., & Yushkevich, A. A. (1979). Controlled Markov processes. Berlin: Springer.CrossRefMATH
go back to reference Filar, J., & Vrieze, K. (1997). Competitive Markov decision processes. New York: Springer.MATH Filar, J., & Vrieze, K. (1997). Competitive Markov decision processes. New York: Springer.MATH
go back to reference Hernández-Lerma, O., & Lasserre, J. B. (1996). Discrete-time Markov control processes. New York: Springer.CrossRefMATH Hernández-Lerma, O., & Lasserre, J. B. (1996). Discrete-time Markov control processes. New York: Springer.CrossRefMATH
go back to reference Hernández-Lerma, O., & Lasserre, J. B. (1999). Further topics on discrete-time Markov control processes. New York: Springer.CrossRefMATH Hernández-Lerma, O., & Lasserre, J. B. (1999). Further topics on discrete-time Markov control processes. New York: Springer.CrossRefMATH
go back to reference Hinderer, K. (1970). Foundations of non-stationary dynamic programming with discrete time parameter (Lecture Notes in Operations Research and Mathematical Systems, Vol. 33). Berlin: Springer.CrossRefMATH Hinderer, K. (1970). Foundations of non-stationary dynamic programming with discrete time parameter (Lecture Notes in Operations Research and Mathematical Systems, Vol. 33). Berlin: Springer.CrossRefMATH
go back to reference Hinderer, K., & Stieglitz, M. (1996). Increasing and Lipschitz continuous minimizers in one-dimensional linear-convex systems without constraints: The continuous and the discrete case. Mathematical Methods of Operations Research, 44, 189–204.MathSciNetCrossRefMATH Hinderer, K., & Stieglitz, M. (1996). Increasing and Lipschitz continuous minimizers in one-dimensional linear-convex systems without constraints: The continuous and the discrete case. Mathematical Methods of Operations Research, 44, 189–204.MathSciNetCrossRefMATH
go back to reference Howard, R. A. (1960). Dynamic programming and Markov processes. Cambridge: Technology Press of Massachusetts Institute of Technology.MATH Howard, R. A. (1960). Dynamic programming and Markov processes. Cambridge: Technology Press of Massachusetts Institute of Technology.MATH
go back to reference Maitra, A. P., & Sudderth, W. D. (1996). Discrete gambling and stochastic games. New York: Springer.CrossRefMATH Maitra, A. P., & Sudderth, W. D. (1996). Discrete gambling and stochastic games. New York: Springer.CrossRefMATH
go back to reference Puterman, M. L. (1994). Markov decision processes: Discrete stochastic dynamic programming. New York: Wiley.CrossRefMATH Puterman, M. L. (1994). Markov decision processes: Discrete stochastic dynamic programming. New York: Wiley.CrossRefMATH
go back to reference Sennott, L. I. (1999). Stochastic dynamic programming and the control of queueing systems. New York: Wiley.MATH Sennott, L. I. (1999). Stochastic dynamic programming and the control of queueing systems. New York: Wiley.MATH
Metadata
Title
Introduction and Organization of the Book
Authors
Karl Hinderer
Ulrich Rieder
Michael Stieglitz
Copyright Year
2016
DOI
https://doi.org/10.1007/978-3-319-48814-1_1