Title :
The (Dantzig) simplex method for linear programming
Author_Institution :
Fac. of Adm., Ottawa Univ., Ont., Canada
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
Keywords :
history; linear programming; operations research; planning; Dantzig simplex method; decision making; generalizations; large-scale enterprises; linear programming; operations research; planning; specializations; Artificial intelligence; Books; Decision making; Equations; Large-scale systems; Linear programming; Log periodic antennas; Operations research;
Journal_Title :
Computing in Science & Engineering
DOI :
10.1109/5992.814654
