Dynamic Programming - History

History

The term dynamic programming was originally used in the 1940s by Richard Bellman to describe the process of solving problems where one needs to find the best decisions one after another. By 1953, he refined this to the modern meaning, referring specifically to nesting smaller decision problems inside larger decisions, and the field was thereafter recognized by the IEEE as a systems analysis and engineering topic. Bellman's contribution is remembered in the name of the Bellman equation, a central result of dynamic programming which restates an optimization problem in recursive form.

The word dynamic was chosen by Bellman to capture the time-varying aspect of the problems, and because it sounded impressive. The word programming referred to the use of the method to find an optimal program, in the sense of a military schedule for training or logistics. This usage is the same as that in the phrases linear programming and mathematical programming, a synonym for mathematical optimization.

Read more about this topic:  Dynamic Programming

Famous quotes containing the word history:

    There is no history of how bad became better.
    Henry David Thoreau (1817–1862)

    The history of all hitherto existing society is the history of class struggles.
    Karl Marx (1818–1883)

    Let it suffice that in the light of these two facts, namely, that the mind is One, and that nature is its correlative, history is to be read and written.
    Ralph Waldo Emerson (1803–1882)