1M.L. Balinski, Mathematical programming: journal society, recollections, in: J.-K. Lenstra, A. H. G. Rinnooy Kan et A. Schrijver, eds., History of Mathematical Programming: a Collection of Personal Reminiscences, CW1 et North-Holland Publishing Company, Amsterdam, pp. 5-18.
2R.E. Bixby, Implementing the simplex method." The initial basis, ORSA Journal on Computing 4 (1992) 267-284.
3R.E.Bixby, Progress in linear programming, ORSAJournal on Computing 6(1 ) (1994) 15-22.
4S.N. Chernikov, Linear Inequalities, Nauka, Moscow, 1968 (in Russian).
5G.B. Dantzig, Maximization of a linear funetion of variables subject to linear inequalities, In Koopmans, T.C., ed., Activity Analysis of Production and Allocation, Wiley, New York, 1951, pp. 339-347.
6G.B. Dantzig, Progress in linear programming, ORSA Journal on Computing 6(1 ) (1963) 15-22.
7J.J. Forrest, D. Goldfarb, Steepest-edge simplex algorithms for linear programming, Mathematical Programming 57 (1992) 341-374.
8N.K. Karmarkar, A new polynomial-time algorithm for linearprogram-ming, Combinatorica 4 (1984) 373-395.
9L.G. Khachiyan, A polynomial algorithm in linear programming (in Russian), Doklady Akademiia Nauk SSSR 224 (1979) 1093-1096.
