2Pan P Q. Linear Programming Computation [M]. Heidelberg: Springer-Verlag, 2014, 571-591.
3Colub G H. Numerical methods for solving linear least squares problems [J]. Numer Math, 1965, 7: 206-216.
4Golub G H, Van Loan C F. Matrix Computations (2edn) [M]. Baltimore: The Johns Hopkins University Press, 1989.
5Saunders M A. Large scale linear programming using the Cholesky factorization[R]. Technical Report STAN-CS-72452, Stanford University, 1972.
二级参考文献23
1R.E. Bixby, Solving real-world linear programs: A decade and more of progress, Oper. Res., 50 (2002), 3-15.
2G.B. Dantzig, Programming in a linear structure, Comptroller, USAF, Washington, D.C. (February 1948).
3G.B. Dantzig and W. Orchard-Hayes, The product form for the inverse in the simplex method, Mathematical Tables and Other Aids to Computation, 8 (1954), 64-67.
4J.J.H. Forrest and D. Goldfarb, Steepest-edge simplex algorithms for linear programming, Math. Program., 57 (1992), 341-374.
5G.H. Golub, Numerical methods for solving linear least squares problems, Numer. Math. 7 (1965), 206-216.
6W.W. Hager, The LP dual active set algorithm, in High-Performance Algorithms and Software in Nonlinear Optimization, Dordrecht, Klower, 1998, 243-254.
7W.W. Hager, The dual active set algorithm and its application to linear programming, Comput. Optim. Appl., 21 (2002), 263-275.
8P.M.J. Harris, Pivot selection methods of the DEVEX LP code, Math. Program., 5 (1973), 1-28.
9J.-F. Hu and Pan P.-Q, An efficient approach to updating simplex multipliers in the simplex algo- rithm, Math. Program., 114 (2008), 235-248.
10N. Karmarkar, A new plolynomial time algorithm for linear programming, Combinatorica, 4 (1984), 373-395.
