Updated triangular factors of the basis to maintain sparsity in the product form simplex method
暂无分享,去创建一个
[1] H. Markowitz. The Elimination form of the Inverse and its Application to Linear Programming , 1957 .
[2] James Hardy Wilkinson,et al. Rounding errors in algebraic processes , 1964, IFIP Congress.
[3] G. Dantzig. COMPACT BASIS TRIANGULARIZATION FOR THE SIMPLEX METHOD , 1962 .
[4] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[5] R. Tewarson. On the product form of inverses of sparse matrices. , 1966 .
[6] William Orchard-Hays,et al. Advanced Linear-Programming Computing Techniques , 1968 .
[7] R. Bartels. A NUMERICAL INVESTIGATION OF THE SIMPLEX METHOD , 1968 .
[8] R. P. Harvey,et al. SPARSE MATRIX TECHNIQUES IN TWO MATHEMATICAL PROGRAMMING CODES , 1969 .
[9] Gene H. Golub,et al. The simplex method of linear programming using LU decomposition , 1969, Commun. ACM.
[10] R. Willoughby,et al. Some results on sparse matrices , 1970 .
[11] Eli Hellerman,et al. Reinversion with the preassigned pivot procedure , 1971, Math. Program..
[12] J. Tomlin. Maintaining a sparse inverse in the simplex method , 1972 .