A degeneracy exploiting LU factorization for the simplex method

DOI10.1007/BF01581646zbMath0442.90054OpenAlexW2016225179MaRDI QIDQ3885512

A. F. Perold

Publication date: 1980

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581646

zbMATH Keywords

updatingLU factorizationdegeneracyimplementationexperimental resultsmultiple pricingBartels-Golub updatingdegenerate simplex method iterations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

A linear programming decomposition focusing on the span of the nondegenerate columns, On the solution of highly degenerate linear programmes, Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis, A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases

Uses Software

• MINOS
• DEVEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Elimination form of the Inverse and its Application to Linear Programming
• Evolution of Linear Programming Computing Techniques
• Bipartite graphs and an optimal bordered triangular form of a matrix
• A practicable steepest-edge simplex algorithm
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• New Finite Pivoting Rules for the Simplex Method
• Reinversion with the preassigned pivot procedure
• Pivot selection methods of the Devex LP code