Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases

DOI10.1287/IJOC.2.4.325MaRDI QIDQ4025910zbMATH OpenOpenAlexWikidataFDO

Authors Uwe H. Suhl, Leena Suhl

Publication date 18 February 1993

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2.4.325

zbMATH Keywords

large sparse matricesLU factorizations

Mathematics Subject Classification ID

Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• scientific article; zbMATH DE number 4059114
• A fast LU update for linear programming
• A Block-LU Update for Large-Scale Linear Programming
• scientific article; zbMATH DE number 3852786
• scientific article; zbMATH DE number 741173

Cited in

(28)

• An efficient simplex type algorithm for sparse and dense linear programs.
• The double pivot simplex method
• Mixed integer programming: A historical perspective with Xpress-MP
• Interior point methods 25 years later
• A survey of direct methods for sparse linear systems
• Numerical aspects in developing LP softwares, LPAKO and LPABO
• Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos
• Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems
• A fast LU update for linear programming
• The augmented system variant of IPMs in two-stage stochastic linear programming computation
• Recovering an optimal LP basis from an interior point solution
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
• Parallel distributed-memory simplex for large-scale stochastic LP problems
• Novel update techniques for the revised simplex method
• On the use of dense matrix techniques within sparse simplex
• A heuristic to generate rank-1 GMI cuts
• Split cuts from sparse disjunctions
• Towards a practical parallelisation of the simplex method
• Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
• Interior point methods in the year 2025
• Advances in design and implementation of optimization software
• MOPS -- Mathematical optimization system
• Supernode processing of mixed-integer models
• Permutations in the Factorization of Simplex Bases
• Steepest-edge simplex algorithms for linear programming
• A primal deficient-basis simplex algorithm for linear programming
• Maintaining LU factors of a general sparse matrix
• Computing in operations research using Julia

This page was built for publication: Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4025910)