dynamic programming

English

Etymology

Coined by American mathematician Richard E. Bellman in the 1940s.

Noun

dynamic programming (uncountable)

  1. (mathematics, computer science) 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.
    • 1975, Sven Danø, Nonlinear and Dynamic Programming: An Introduction, Springer Science & Business Media, →ISBN, page 73:
      The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition.
    • 2000, Rein Luus, “Preface”, in Iterative Dynamic Programming‎[1], CRC Press, →ISBN:
      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.

Translations

See also

This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.