The NETFLOW Procedure

References

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

Kearney, T.D. (1990), "A Tutorial on the NETFLOW Procedure in SAS/OR", Proceedings of the fifteenth Annual SAS Users Group International Conference, 97-108.

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

Reid, J.K. (1975), "A Sparsity-Exploiting Variant of the Bartels-Golub Decomposition for Linear Programming Bases", Harwell Report CSS 20, A.E.R.E., Didcot, Oxfordshire, England.

Roos, C. Terlaky, T. Vial, J.-Ph. (1997) "Theory and Algorithms for Linear Optimization", 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", Wiley-Interscience Series in Discrete Mathematics and Optimization.

Chapter Contents
Previous
Next
Top