The (Dantzig) simplex method for linear programming

Computing in Science and Engineering

Volumn 2, Issue 1, 2000, Pages 29-31

  Nash, John C ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345846148     PISSN: 15219615     EISSN: None     Source Type: Journal    
DOI: 10.1109/5992.814654     Document Type: Article

References (7)

1. S.C. Nash, A History of Scientific Computing, ACM Press, New York, 1990, pp. 141-151.
2. J.A. Neider and R. Mead, "A Simplex Method for Function Minimization," Computer J., Vol. 7, 1965, pp. 308-313.
3. S. Gass, Linear Programming, 2nd ed., McGraw-Hill, New York, 1964.
4. G. Hadley, Linear Programming, Addison-Wesley, Reading, Mass., 1962.
5. S.G. Nash and A. Sofer, Linear and Nonlinear Programming, McGraw-Hill, New York, 1996.
6. J.L. Nazareth, Computer Solution of Linear Programs, Oxford Science Publications, New York, 1987.
7. G. Sande, "Automated Cell Suppression to Preserve Confidentiality of Business Statistics," Statistical J. United Nations ECE, Vol. 2, 1984, pp. 33-41.