A bump triangular dynamic factorization algorithm for the simplex method

DOI10.1007/BF01588296MaRDI QIDQ3865837zbMATH OpenFDO

Authors Richard D. McBride

Publication date 1980

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

sparse matricessimplex methodcomputational experiencecomparison of algorithmslarge- scale linear programmingbump triangular dynamic factorization algorithmpartitioning methodstriangular factorization of the basis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3538745 (Why is no real title available?)
• scientific article; zbMATH DE number 1024452 (Why is no real title available?)
• A Spike Collective Dynamic Factorization Algorithm for the Simplex Method
• A complete constructive algorithm for the general mixed linear programming problem
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• Matrix augmentation and partitioning in the updating of the basis inverse
• Pivot selection methods of the Devex LP code
• Reinversion with the preassigned pivot procedure
• The factorization approach to large-scale linear programming
• The simplex method of linear programming using LU decomposition
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method

Cited in

(7)

• Large-scale linear programming: Geometry, working bases and factorizations
• A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
• Dynamic factorization in large-scale optimization
• A Hierarchical Representation of the Inverse for Sparse Matrices
• Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases

Describes a project that uses

Uses Software

• DEVEX

This page was built for publication: A bump triangular dynamic factorization algorithm for the simplex method

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