1. D. Avis and V. Chvátal, Note on Bland's pivoting rule,Math. Programming Stud.,8 (1978), 24–34.
2. M. Iri, Another “simple and fast” algorithm for linear programming, paper presented at the 12th International Symposium on Mathematical Programming, August 5–9, 1985, MIT, Boston.
3. M. Iri and H. Imai, A method of solving linear programming — with reference to the Karmarkar method and the penalty function method, Research Meeting of the Mathematical Programming Research Group of the Operations Research Society of Japan, February 16, 1985.
4. N. Karmarkar, A new polynomial-time algorithm for linear programming,Combinatorica,4 (1984), 373–395.
5. L. G. Khachian, A polynomial algorithm in linear programming,Dokl. Akad. Nauk SSSR,244 (1979), 1093–1096 (in Russian); transl. inSoviet Math. Dokl.,20 (1979), 191–194.