A fast LU update for linear programming
暂无分享,去创建一个
[1] Gene H. Golub,et al. The simplex method of linear programming using LU decomposition , 1969, Commun. ACM.
[2] Uwe H. Suhl,et al. MOPS -- Mathematical optimization system , 1994 .
[3] Iain S. Duff,et al. Direct methods for sparse matrices27100 , 1986 .
[4] John A. Tomlin,et al. Updated triangular factors of the basis to maintain sparsity in the product form simplex method , 1972, Math. Program..
[5] John K. Reid,et al. A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases , 1982, Math. Program..
[6] J. A. Tomlin. An accuracy test for updating triangular factors , 1975 .
[7] Uwe H. Suhl,et al. Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases , 1990, INFORMS J. Comput..
[8] Michel Bénichou,et al. The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results , 1977, Math. Program..
[9] Robert Fourer,et al. Solving staircase linear programs by the simplex method, 1: Inversion , 1982, Math. Program..
[10] R. Willoughby,et al. Some results on sparse matrices , 1970 .
[11] I. Duff,et al. Direct Methods for Sparse Matrices , 1987 .