History
Fermat and Lagrange found calculus-based formulas for identifying optima, while Newton and Gauss proposed iterative methods for moving towards an optimum. Historically, the first term for optimization was "linear programming", which was due to George B. Dantzig, although much of the theory had been introduced by Leonid Kantorovich in 1939. Dantzig published the Simplex algorithm in 1947, and John von Neumann developed the theory of duality in the same year.
The term programming in this context does not refer to computer programming. Rather, the term comes from the use of program by the United States military to refer to proposed training and logistics schedules, which were the problems Dantzig studied at that time.
Later important researchers in mathematical optimization include the following:
|
|
Read more about this topic: Optimization Glossary
Famous quotes containing the word history:
“A people without history
Is not redeemed from time, for history is a pattern
Of timeless moments.”
—T.S. (Thomas Stearns)
“My good friends, this is the second time in our history that there has come back from Germany to Downing Street peace with honour. I believe it is peace for our time. We thank you from the bottom of our hearts. And now I recommend you to go home and sleep quietly in your beds.”
—Neville Chamberlain (1869–1940)
“The history of the Victorian Age will never be written: we know too much about it.”
—Lytton Strachey (1880–1932)