The (Dantzig) simplex method for linear programming

Authors
Nash, JC
Citation
Jc. Nash, The (Dantzig) simplex method for linear programming, COMPUT SC E, 2(1), 2000, pp. 29-31
Citations number
7
Categorie Soggetti
Multidisciplinary,"Computer Science & Engineering
Journal title
COMPUTING IN SCIENCE & ENGINEERING
ISSN journal
15219615 → ACNP
Volume
2
Issue
1
Year of publication
2000
Pages
29 - 31
Database
ISI
SICI code
1521-9615(200001/02)2:1<29:T(SMFL>2.0.ZU;2-U
Abstract
George Dantzig created a simplex algorithm to solve linear programs for pla nning and decision-making in large-scale enterprises. The algorithm's succe ss led to a vast array of specializations and generalizations that have dom inated practical operations research for half a century.