Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
From MaRDI portal
Publication:4025910
DOI10.1287/ijoc.2.4.325zbMath0755.90059OpenAlexW1971049631WikidataQ114058175 ScholiaQ114058175MaRDI QIDQ4025910
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
Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (25)
Numerical aspects in developing LP softwares, LPAKO and LPABO ⋮ Recovering an optimal LP basis from an interior point solution ⋮ Supernode processing of mixed-integer models ⋮ Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms ⋮ Computing in Operations Research Using Julia ⋮ Parallel distributed-memory simplex for large-scale stochastic LP problems ⋮ A heuristic to generate rank-1 GMI cuts ⋮ Split cuts from sparse disjunctions ⋮ Interior point methods 25 years later ⋮ Permutations in the Factorization of Simplex Bases ⋮ The double pivot simplex method ⋮ A primal deficient-basis simplex algorithm for linear programming ⋮ Mixed integer programming: A historical perspective with Xpress-MP ⋮ A survey of direct methods for sparse linear systems ⋮ Towards a practical parallelisation of the simplex method ⋮ Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos ⋮ Steepest-edge simplex algorithms for linear programming ⋮ An efficient simplex type algorithm for sparse and dense linear programs. ⋮ Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation ⋮ The augmented system variant of IPMs in two-stage stochastic linear programming computation ⋮ On the use of dense matrix techniques within sparse simplex ⋮ A fast LU update for linear programming ⋮ Advances in design and implementation of optimization software ⋮ MOPS -- Mathematical optimization system ⋮ Novel update techniques for the revised simplex method
This page was built for publication: Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
