Dynamic programming
noun
noun ·Rare ·Advanced level
Definitions
Noun
- 1 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. uncountable
"The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition."
Synonyms
All synonymsExample
More examples"The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition."
Etymology
Coined by American mathematician Richard E. Bellman in the 1940s.