The Community for Technology Leaders
Green Image
Issue No. 01 - January/February (2000 vol. 2)
ISSN: 1521-9615
pp: 29-31
The Dantzig simplex algorithm was created to solve linear programs for planning and decision making in large-scale enterprises. That is, we want to optimize models of organizational structures specified with a linear objective function and linear inequality constraints. The success of the simplex method led to a vast array of specializations and generalizations that have dominated practical operations research for half a century.

J. C. Nash, "The (Dantzig) Simplex Method for Linear Programming," in Computing in Science & Engineering, vol. 2, no. , pp. 29-31, 2000.
82 ms
(Ver 3.3 (11022016))