On the use of dense matrix techniques within sparse simplex

DOI10.1007/BF02025532zbMath0784.90047MaRDI QIDQ1309853

Janez Grad, Janez Barle

Publication date: 21 March 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

Schur complement matrixdense matrix techniquessparse simplex linear programming

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (1)

Perturbed matrix inversion with application to LP simplex method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large sparse numerical optimization
• Matrix computations.
• An analysis of an available set of linear programming test problems
• A practical anti-cycling procedure for linearly constrained optimization
• Manifestations of the Schur complement
• A note on splitting the bump in an elimination factorization
• Stable modification of explicitLU factors for simplex updates
• Spike swapping in basis reinversion
• Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
• Matrix augmentation and partitioning in the updating of the basis inverse
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• On Exploiting Original Problem Data in the Inverse Representation of Linear Programming Bases
• Stable algorithm for updating denseLUfactorization after row or column exchange and row and column addition or deletion
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• Reinversion with the preassigned pivot procedure

This page was built for publication: On the use of dense matrix techniques within sparse simplex