Bellman Equation

AKA: Dynamic Programming Equation.
See: Richard Bellman, Necessary Condition, Optimization (Mathematics), Dynamic Programming, Control Theory, Economic Theory, Optimal Control Theory, Discrete-Time, Partial Differential Equation, Hamilton–Jacobi–Bellman Equation.

References

(Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/Bellman_equation Retrieved:2015-1-12.
- A Bellman equation, named after its discoverer, Richard Bellman, also known as a dynamic programming equation, is a necessary condition for optimality associated with the mathematical optimization method known as dynamic programming. It writes the value of a decision problem at a certain point in time in terms of the payoff from some initial choices and the value of the remaining decision problem that results from those initial choices. This breaks a dynamic optimization problem into simpler subproblems, as Bellman's Principle of Optimality prescribes.
  The Bellman equation was first applied to engineering control theory and to other topics in applied mathematics, and subsequently became an important tool in economic theory.
  Almost any problem which can be solved using optimal control theory can also be solved by analyzing the appropriate Bellman equation. However, the term 'Bellman equation' usually refers to the dynamic programming equation associated with discrete-time optimization problems. In continuous-time optimization problems, the analogous equation is a partial differential equation which is usually called the Hamilton–Jacobi–Bellman equation.

(Sammut & Webb, 2011) ⇒ Claude Sammut (editor), and Geoffrey I. Webb (editor). (2011). “Bellman Equation.” In: (Sammut & Webb, 2011) p.97