Editing Mathematical optimization (section)

== History ==
[[Pierre de Fermat|Fermat]] and [[Joseph-Louis Lagrange|Lagrange]] found calculus-based formulae for identifying optima, while [[Isaac Newton|Newton]] and [[Carl Friedrich Gauss|Gauss]] proposed iterative methods for moving towards an optimum.

The term "[[linear programming]]" for certain optimization cases was due to [[George Dantzig|George&nbsp;B. Dantzig]], although much of the theory had been introduced by [[Leonid Kantorovich]] in 1939. (''Programming'' in this context does not refer to [[computer programming]], but 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.) Dantzig published the [[Simplex algorithm]] in 1947, and also [[John von Neumann]] and other researchers worked on the theoretical aspects of linear programming (like the theory of [[Linear programming#Duality|duality]]) around the same time.<ref>{{Cite journal |last=Bixby |first=Robert E |date=2012 |title=A brief history of linear and mixed-integer programming computation |url=https://www.math.uni-bielefeld.de/documenta/vol-ismp/25_bixby-robert.pdf |journal=Documenta Mathematica |series=Documenta Mathematica Series |volume=2012 |pages=107–121|doi=10.4171/dms/6/16 |doi-access=free |isbn=978-3-936609-58-5 }}</ref>

Other notable researchers in mathematical optimization include the following:
{{Div col|colwidth=20em}}
* [[Richard Bellman]]
* [[Dimitri Bertsekas]]
* [[Michel Bierlaire]]
* [[Stephen P. Boyd]]
* [[Roger Fletcher (mathematician)|Roger Fletcher]]
* [[Martin Grötschel]]
* [[Ronald A. Howard]]
* [[Fritz John]]
* [[Narendra Karmarkar]]
* [[William Karush]]
* [[Leonid Khachiyan]]
* [[Bernard Koopman]]
* [[Harold Kuhn]]
* [[László Lovász]]
* [[David Luenberger]]
* [[Arkadi Nemirovski]]
* [[Yurii Nesterov]]
* [[Lev Pontryagin]]
* [[R. Tyrrell Rockafellar]]
* [[Naum Z. Shor]]
* [[Albert W. Tucker|Albert Tucker]]
{{div col end}}
<!--In fact, some mathematical programming work had been done previously... (anyone? - Gauss did some stuff here), Gauss developed the method of least squares, which is an optimization method. -->