The Product Form for the Inverse in the Simplex Method
From MaRDI portal
Publication:5827288
DOI10.2307/2001993zbMath0055.35103OpenAlexW4235019687MaRDI QIDQ5827288
William Orchard-Hays, George B. Dantzig
Publication date: 1954
Published in: Mathematical Tables and Other Aids to Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2001993
Related Items
A timing model for the revised simplex method, On the efficacy of distributed simplex algorithms for linear programming, Parallel search paths for the simplex algorithm, Parallel distributed-memory simplex for large-scale stochastic LP problems, Efficient GPU-based implementations of simplex type algorithms, A projective simplex algorithm using LU decomposition, Some Results on Sparse Matrices, The double pivot simplex method, Towards a practical parallelisation of the simplex method, Hyper-sparsity in the revised simplex method and how to exploit it, Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors, An affine-scaling pivot algorithm for linear programming, Inverse matrix representation with one triangular array, Novel update techniques for the revised simplex method
