1. Bixby, R. E. (1992). Implementing the simplex method: The initial basis. ORSA Journal on Computing, 4, 267–284.
2. Borgwardt, H. K. (1982). The average number of pivot steps required by the simplex method is polynomial. Zeitschrift fur Operational Research, 26(1), 157–177.
3. Carstens, D. M. (1968) Crashing techniques. In W. Orchard-Hays (Ed.), Advanced linear-programming computing techniques (pp. 131–139). New York: McGraw-Hill.
4. Dantzig, G. B. (1949). Programming in linear structure. Econometrica, 17, 73–74.
5. Dantzig, G. B. (1963). Linear programming and extensions. Princeton, NJ: Princeton University Press.