| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1141835 | Discrete Optimization | 2008 | 12 Pages |
Abstract
George Dantzig created the simplex algorithm for linear programming, perhaps the most important algorithm developed in the 20th century. This paper traces a single historical thread: Dantzig’s work on linear programming and its application and extension to combinatorial optimization, and the investigations it has stimulated about the performance of the simplex algorithm and the intrinsic complexity of linear programming and combinatorial optimization.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
Richard M. Karp,