This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The (Dantzig) Simplex Method for Linear Programming
January/February 2000 (vol. 2 no. 1)
pp. 29-31
ASCII Text
x 
 
John C. Nash, "The (Dantzig) Simplex Method for Linear Programming," Computing in Science and Engineering, vol. 2, no. 1, pp. 29-31, January/February, 2000.
 
 
BibTex
x
 
@article{ 10.1109/5992.814654,
author = {John C. Nash},
title = {The (Dantzig) Simplex Method for Linear Programming},
journal ={Computing in Science and Engineering},
volume = {2},
number = {1},
issn = {1521-9615},
year = {2000},
pages = {29-31},
doi = {http://doi.ieeecomputersociety.org/10.1109/5992.814654},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - Computing in Science and Engineering
TI - The (Dantzig) Simplex Method for Linear Programming
IS - 1
SN - 1521-9615
SP29
EP31
EPD - 29-31
A1 - John C. Nash,
PY - 2000
VL - 2
JA - Computing in Science and Engineering
ER -
 
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.
Citation:
John C. Nash, "The (Dantzig) Simplex Method for Linear Programming," Computing in Science and Engineering, vol. 2, no. 1, pp. 29-31, Jan.-Feb. 2000, doi:10.1109/5992.814654
Usage of this product signifies your acceptance of the Terms of Use.