1. G.B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
2. R.J. Vanderbei, Linear Programming: Foundations and Extensions, Kluwer Academic Publishers, Boston, 1996.
3. S.J. Wright, Primal-Dual Interior-Point Methods, Society for Industrial and Applied Mathematics, Philadelphia, 1997.
4. J.K. Lenstra, A.H.G. Rinnooy Kan, A. Schrijver (eds.), History of Mathematical Programming: a collection of personal reminiscences, North-Holland, Amsterdam, 1991.
5. George B. Dantzig. Linear programming. Operations Research, 50(1):42-47, 2002.
6. George B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, New Jersey, 1963.
7. Shu-Cherng Fang and Sarat Puthenpura. Linear optimization and extensions: theory and algorithms. Prentice Hall, Englewood Cliffs, New Jersey,1993.
8. Victor Klee and George J. Minty. How good is the simplex algorithm? In 0. Shisha, editor, Inequalities III, pages 159-175. Academic Press, New York, 1972.
9. Ron Shamir. The efficiency of the simplex method: a survey. Management Science, 33(3):301-334, 1987.
10. Alexander Schrijver. Theory of linear and integer programming, John Wiley and Sons, New York, 1986.
11. Donald Goldfarb and Michael J. Todd. Modifications and implementation of the ellipsoid algorithm for linear programming. Mathematical Programming, 23:1-19, 1982.
12. George L. Nemhauser and Laurence A. Wolsey. Integer and combinatorial optimization. John Wiley and Sons, New York, 1988.
13. Margaret H. Wright. Interior methods for constrained optimization. In Acta Numerica 1992, pages 341-407. Cambridge University Press, 1992.
14. Narendra Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4:373-395, 1984.
15. Ilan Adler, Mauricio G. C. Resende, Geraldo Veiga, and Narendra Karmarkar. An implementation of Karmarkar’s algorithm for linear programming. Mathematical Programming, 44:297-335, 1989.
16. Erling D. Andersen, Jacek Gondzio, Csaba Meszaros, and Xiaojie Xu. Implementation of interior-point methods for large scale linear programs. In pages 189-252. Kluwer Academic Publishers, 1996.
17. Robert E. Bixby. Progress in linear programming. ORSA Journal on Computing, 6(1):15-22, 1994.
18. Robert E. Bixby. Solving real-world linear programs: a decade and more of progress. Operations Research, 50(1):3-15, 2002.
19. Julian A. J. Hall and Ken I. M. McKinnon. Hyper-sparsity in the revised simplex method and how to exploit it. Computational Optimization and Applications, 32(3):259-283, 2005.
20. Stephen J. Wright. Primal-dual interior-point methods. SIAM, Philadelphia, 1997.
21. Yinyu Ye. Interior-point algorithm: theory and analysis. John Wiley and Sons, New York, 1997.
22. Irvin J. Lustig, Roy E. Marsten, and David F. Shanno. Interior point methods for linear programming: computational state of the art. ORSA Journal on Computing, 6(1):1-14, 1994.
23. Jacek Gondzio and Tamas Terlaky. A computational view of interior point methods for linear programming. In J. E. Beasley, editor, Advances in Linear and Integer Programming, chapter 3, pages 103-144. Oxford University Press, Oxford, England, 1996.
24. Shu-Cherng Fang and Sarat Puthenpura. Linear optimization and extensions: theory and algorithms. Prentice Hall, Englewood Cliffs, New Jersey,1993.
25. “Operations Research,” Volume 50, Number 1, January/February 2002.
26. Zionts S. The criss-cross method for solving linear programming problems. Mngt Sci 15: 426-445,1969.
27. Bland RG. New finite pivoting rules for the simplex method. Math Opns Res 2: 103-107,1977.
28. Chang Y. Least index resolution of degeneracy in linear complementary problems. Technical Report 79-14, Department of Operations Research, Stanford University, 1979.
29. Terlaky T. A convergent criss-cross method. Math OperStat, Ser Optim 16: 683-690,1985.
30. Wang Z. A conformal elimination-free algorithm for oriented matroid programming. Chin Ann Math 8: 120-125,1997.
31. Terlaky T and Zhang S. Pivot rules for linear programming: a survey on recent theoretical developments. Ann Opns Res 46: 202-233,1993.
32. Jacek Gondzio and Andreas Grothey. Reoptimization with the primal-dual interior point method. SIAM Journal on Optimization, 13(3):842-864, 2003
33. Aurelio R. L. Oliveira and Danny C. Sorensen. A new class of preconditioners for large-scale linear systems from interior point methods for linear programming. Linear Algebra and its Applications, 394:1-24, 2005.
34. Elizabeth John and E. Alper Yidirim. Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimensions.Technical report, Department of Industrial Engineering, Bilkent University,Turkey, May 2006. Accepted for publication in Computational Optimization and Applications.
35. Peter Kall and Janos Mayer. Some insights into the solution algorithms for SLP problems. Annals of Operations Research, 142:147-164, 2006.
36. Paparrizos, K., Samaras, N., and Stephanides, G., "A new efficient primal dual simplex algorithm", Computers and Operations Research, 30:1383-1399,2003.
37. Samaras, Sifelaras et. al., “A primal-dual exterior point algorithm for linear programming problems”,Yugoslav Journal of Operations Research Vol.19 Number 1, 123-132,2009.