References

Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993), Network Flows, Prentice-Hall, New Jersey.

Bland, R. G. (1977), “New Finite Pivoting Rules for the Simplex Method,” Mathematics of Operations Research, 2, 103–107.

George, A., Liu, J., and Ng, E. (2001), “Computer Solution of Positive Definite Systems,” Unpublished book obtainable from authors.

Jensen, P. A. and Bard, J. F. (2003), Operations Research Models and Methods, John Wiley & Sons.

Kearney, T. D. (1990), “A Tutorial on the NETFLOW Procedure in SAS/OR,” in Proceedings of the Fifteenth Annual SAS Users Group International Conference, Cary, NC: SAS Institute Inc.

Kennington, J. L. and Helgason, R. V. (1980), Algorithms for Networking Programming, New York: Wiley Interscience.

Lustig, I. J., Marsten, R. E., and Shanno, D. F. (1992), “On Implementing Mehrotra’s Predictor-Corrector Interior-Point Method for Linear Programming,” SIAM Journal of Optimization, 2, 435–449.

Reid, J. K. (1975), “A Sparsity-Exploiting Variant of the Bartels-Golub Decomposition for Linear Programming Bases,” Harwell Report CSS 20.

Roos, C., Terlaky, T., and Vial, J. (1997), Theory and Algorithms for Linear Optimization, Chichester, England: John Wiley & Sons.

Ryan, D. M. and Osborne, M. R. (1988), “On the Solution of Highly Degenerate Linear Programmes,” Mathematical Programming, 41, 385–392.

Wright, S. J. (1996), Primal-Dual Interior Point Algorithms, Philadelphia: SIAM.

Ye, Y. (1996), Interior Point Algorithms: Theory and Analysis, New York: John Wiley & Sons.