Updated triangular factors of the basis to maintain sparsity in the product form simplex method-Reference-Cited by-同舟云学术

Updated triangular factors of the basis to maintain sparsity in the product form simplex method

Published:1972-02 Issue:1 Volume:2 Page:263-278
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Forrest J. J. H.,Tomlin J. A.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01584548.pdf

Reference16 articles.

1. R.H. Bartels, “A numerical investigation of the simplex method,” Computer Science Department, Stanford University, Technical Report No. CS-104, July 31, 1968.

2. R.H. Bartels and G.H. Golub, “The simplex method of linear programming using LU decomposition,”Communications ACM 12 (1969) 266–268, 275–278.

3. E.M.L. Beale, “Sparseness in linear programming,” in:Large sparse sets of linear equations, Ed. J.K. Reid (Academic Press, London, 1970) pp. 1–15.

4. J.M. Bennett and D.R. Green, “Updating the inverse or the triangular factors of a modified matrix,” Basser Computing Department, University of Sydney, Technical Report No. 42, April, 1966.

5. R.K. Brayton, F.G. Gustavson and R.A. Willoughby, “Some results on sparse matrices,” RC-2332, IBM Research Centre, Yorktown Heights, N.Y., February 14, 1969.

Cited by 154 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Implementation of Simplex Method;Linear Programming Computation;2023

2. A triangulation and fill-reducing initialization procedure for the simplex algorithm;Mathematical Programming Computation;2020-06-26

3. Rank revealing Gaussian elimination by the maximum volume concept;Linear Algebra and its Applications;2020-05

4. Implementation Issues;International Series in Operations Research & Management Science;2020

5. Permutations in the Factorization of Simplex Bases;INFORMS Journal on Computing;2019-07