Content deleted Content added
LaTeX syntax of equation corrected |
m →top: rm space |
||
Line 1:
{{about|the linear programming algorithm|the non-linear optimization heuristic|Nelder–Mead method}}
<!-- {{Context|date=March 2012}} -->
In [[optimization (mathematics)|mathematical optimization]], [[George Dantzig|Dantzig]]'s '''simplex algorithm''' (or '''simplex method''') is a popular [[algorithm]] for [[linear programming]].<ref name="Murty">{{cite book|last=Murty|first=Katta G.|authorlink=Katta G. Murty|title=Linear programming|publisher=John Wiley & Sons Inc.|___location=New York|year=1983|pages=xix+482|isbn=0-471-09725-X|mr=720547}}</ref><ref name="BasicDantzig">Richard W. Cottle, ed. ''The Basic George B. Dantzig''. Stanford Business Books, Stanford University Press, Stanford, California, 2003. (Selected papers by [[George B. Dantzig]])</ref><ref name="DantzigThapa1">[[George B. Dantzig]] and Mukund N. Thapa. 1997. ''Linear programming 1: Introduction''. Springer-Verlag.</ref><ref name="DantzigThapa2" >
[[George B. Dantzig]] and Mukund N. Thapa. 2003. ''Linear Programming 2: Theory and Extensions''. Springer-Verlag.</ref><ref name="Todd" >{{cite journal|author=[[Michael J. Todd (mathematician)|Michael J. Todd]] | year = 2002 | title = The many facets of linear programming | journal = Mathematical Programming | volume = 91 | issue = 3 | month = February}} (Invited survey, from the International Symposium on Mathematical Programming.)</ref> The journal ''[[Computing in Science and Engineering]]'' listed it as one of the top 10 algorithms of the twentieth century.<ref>''Computing in Science and Engineering'', volume 2, no. 1, 2000 [http://www.computer.org/csdl/mags/cs/2000/01/c1022.html html version]</ref>
| |||