dynamic programming

Hello, you have come here looking for the meaning of the word dynamic programming. In DICTIOUS you will not only get to know all the dictionary meanings for the word dynamic programming, but we will also tell you about its etymology, its characteristics and you will know how to say dynamic programming in singular and plural. Everything you need to know about the word dynamic programming you have here. The definition of the word dynamic programming will help you to be more precise and correct when speaking or writing your texts. Knowing the definition ofdynamic programming, as well as those of other words, enriches your vocabulary and provides you with more and better linguistic resources.

English

English Wikipedia has an article on:
Wikipedia

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‎, 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

Wikious
Boobota
Sagapedia