dynamic programming
nounEtymology Coined by American mathematician Richard E. Bellman in the 1940s.
1
Computer, Computing, Engineering, Mathematics, Natural sciences, Physical sciences, Science, Sciences An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution.
- The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition.1975, Sven Danø, Nonlinear and Dynamic Programming: An Introduction, Springer Science & Business Media, →ISBN, page 73:
- Dynamic programming, developed by Richard Bellmann, is a powerful method for solving optimization problems. It has the attractive feature of breaking up a complex optimization problem into a number of simpler problems.2000, Rein Luus, “Preface”, in Iterative Dynamic Programming, CRC Press, →ISBN:
- Related terms
- Bellman equation