%0 Book Section %1 615762 %A Nash, John C. %B Computing in Science and Engg. %C Piscataway, NJ, USA %D 2000 %I IEEE Educational Activities Department %K algorithm magazine matrix simplex top.ten.algorithms %N 1 %P 29--31 %R 10.1109/5992.814654 %T The (Dantzig) Simplex Method for Linear Programming %V 2 %X In 1947, George Dantzig created a simplex algorithm to solve linear programs for planning and decision-making in large-scale enterprises. The algorithm's success led to a vast array of specializations and generalizations that have dominated practical operations research for half a century

@incollection{615762, abstract = {In 1947, George Dantzig created a simplex algorithm to solve linear programs for planning and decision-making in large-scale enterprises. The algorithm's success led to a vast array of specializations and generalizations that have dominated practical operations research for half a century}, added-at = {2010-02-26T23:23:28.000+0100}, address = {Piscataway, NJ, USA}, author = {Nash, John C.}, biburl = {https://www.bibsonomy.org/bibtex/2b85e2108e8f7cc402a52577323035ad9/ytyoun}, booktitle = {Computing in Science and Engg.}, doi = {10.1109/5992.814654}, interhash = {5fb3b9e4a0e81f7811c917b86d1097cb}, intrahash = {b85e2108e8f7cc402a52577323035ad9}, issn = {1521-9615}, keywords = {algorithm magazine matrix simplex top.ten.algorithms}, number = 1, pages = {29--31}, publisher = {IEEE Educational Activities Department}, timestamp = {2015-12-13T09:44:24.000+0100}, title = {The (Dantzig) Simplex Method for Linear Programming}, volume = 2, year = 2000 }