go-v.orgcodex
Menu
Page tools

codex · Philosophy

Dynamic programming

Diagram for Dynamic programming
Dynamic programming (DP) is both a mathematical optimization method and an algorithmic paradigm. The method was developed by Richard Bellman in the 1950s and has found applications in numerous fields, such as aerospace engineering and economics. · image: Wikimedia Commons

Dynamic programming (DP) is both a mathematical optimization method and an algorithmic paradigm. The method was developed by Richard Bellman in the 1950s and has found applications in numerous fields, such as aerospace engineering and economics. In both contexts, it refers to simplifying a complex problem by breaking it down into simpler subproblems in a recursive manner. While some decision problems cannot be taken apart this way, decisions that span several points in time do often break apart recursively.

Likewise, in computer science, if a problem can be solved optimally by breaking it into subproblems and then recursively finding the optimal solutions to the subproblems, then it is said to have optimal substructure. If subproblems can be nested recursively inside larger problems, so that dynamic programming methods are applicable, then there is a relation between the value of the larger problem and the values of the subproblems. In the optimization literature, this relationship is called the Bellman equation.

Wikipedia contributors, "Dynamic programming", Wikipedia, revision 1385371281, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex