Editing Recursion (section)

===Recursive optimization===
[[Dynamic programming]] is an approach to [[optimization (mathematics)|optimization]] that restates a multiperiod or multistep optimization problem in recursive form. The key result in dynamic programming is the [[Bellman equation]], which writes the value of the optimization problem at an earlier time (or earlier step) in terms of its value at a later time (or later step).