Mathematical Optimization - History

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:

  • Richard Bellman
  • Ronald A. Howard
  • Narendra Karmarkar
  • William Karush
  • Leonid Khachiyan
  • Bernard Koopman
  • Harold Kuhn
  • Joseph Louis Lagrange
  • László Lovász
  • Arkadi Nemirovski
  • Yurii Nesterov
  • Boris Polyak
  • Lev Pontryagin
  • James Renegar
  • R. Tyrrell Rockafellar
  • Cornelis Roos
  • Naum Z. Shor
  • Michael J. Todd
  • Albert Tucker

Read more about this topic:  Mathematical Optimization

Famous quotes containing the word history:

    The one duty we owe to history is to rewrite it.
    Oscar Wilde (1854–1900)

    The History of the world is not the theatre of happiness. Periods of happiness are blank pages in it, for they are periods of harmony—periods when the antithesis is in abeyance.
    Georg Wilhelm Friedrich Hegel (1770–1831)

    Well, for us, in history where goodness is a rare pearl, he who was good almost takes precedence over he who was great.
    Victor Hugo (1802–1885)