Bellman equation: Difference between revisions
Jump to navigation
Jump to search
(Started introduction) |
m (Page orphaned, available for future project) |
||
| Line 1: | Line 1: | ||
== Introduction == | == Introduction == | ||
The Bellman equation is an optimality condition used in dynamic programming and named for Richard Bellman, whose principle of optimality is needed to derive it.<ref>Bellman, R. (1952) "On the Theory of Dynamic Programming" https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1063639/pdf/pnas01581-0064.pdf</ref> By breaking up a larger dynamic programming problem into a sequence of subproblems, a Bellman equation can simplify and solve any multi-stage dynamic optimization problem. | The Bellman equation is an optimality condition used in dynamic programming and named for Richard Bellman, whose principle of optimality is needed to derive it.<ref>Bellman, R. (1952) "On the Theory of Dynamic Programming" https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1063639/pdf/pnas01581-0064.pdf</ref> By breaking up a larger dynamic programming problem into a sequence of subproblems, a Bellman equation can simplify and solve any multi-stage dynamic optimization problem. | ||
Latest revision as of 17:14, 28 November 2021
Introduction
The Bellman equation is an optimality condition used in dynamic programming and named for Richard Bellman, whose principle of optimality is needed to derive it.[1] By breaking up a larger dynamic programming problem into a sequence of subproblems, a Bellman equation can simplify and solve any multi-stage dynamic optimization problem.
- ↑ Bellman, R. (1952) "On the Theory of Dynamic Programming" https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1063639/pdf/pnas01581-0064.pdf