1. Badr, E. S., Moussa, M., Papparrizos, K., Samaras, N., & Sifaleras, A. (2006). Some computational results on MPI parallel implementations of dense simplex method. In Proceedings of World Academy of Science, Engineering and Technology, 23, (CISE 2006), Cairo, Egypt, 39–32.
2. Bartels, R. H., & Golub, G. H. (1969). The simplex method of linear programming using LU decomposition. Communications of the ACM, 12, 266–268.
3. Benhamadou, M. (2002). On the simplex algorithm revised form. Advances in Engineering Software, 33(11–12), 769–777.
4. Brayton, R. K., Gustavson, F. G., & Willoughby, R. A. (1970) Some results on sparse matrices. Mathematics of Computation, 24, 937–954.
5. Chvatal, V. (1983). Linear programming. New York, USA: W.H. Freeman and Company.