Dynamic programming is a method that solves a complicated multi-stage decision problem by first transforming it into a sequence of simpler problems. Bellman equations, named after the creator of dynamic programming Richard E. Bellman (1920–1984), are functional equations that embody this transformation.
KeywordsBellman equation Consumption smoothing Convergence Dynamic programming Markov processes Neoclassical growth theory Value function
- Bellman, R. 1957. Dynamic programming. Princeton: Princeton University Press.Google Scholar
- Bertsekas, D.P. 1976. Dynamic programming and stochastic control. New York: Academic Press.Google Scholar
- Ljungqvist, L., and T.J. Sargent. 2004. Recursive macroeconomic theory. 2nd ed. Cambridge, MA: MIT Press.Google Scholar
- Stokey, N.L., and R.E. Lucas Jr. 1989. Recursive methods in economic dynamics. Cambridge: Harvard University Press.Google Scholar