On the Bartels—Golub decomposition for linear programming bases

DOI10.1007/BF01584343zbMath0379.90070MaRDI QIDQ4158808

Donald Goldfarb

Publication date: 1977

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

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (10)

Matrix augmentation and partitioning in the updating of the basis inverse ⋮ Large-scale linearly constrained optimization ⋮ A practicable steepest-edge simplex algorithm ⋮ A triangulation and fill-reducing initialization procedure for the simplex algorithm ⋮ Solving staircase linear programs by the simplex method, 2: Pricing ⋮ An implementation of the simplex method for linear programming problems with variable upper bounds ⋮ A quasi-Newton method with modification of one column per iteration ⋮ Solving staircase linear programs by the simplex method, 1: Inversion ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis ⋮ A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases

Uses Software

• DEVEX

Cites Work

• Unnamed Item
• A stabilization of the simplex method
• A practicable steepest-edge simplex algorithm
• On pricing and backward transformation in linear programming
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• The Composite Simplex Algorithm
• The simplex method of linear programming using LU decomposition
• Pivot selection methods of the Devex LP code

This page was built for publication: On the Bartels—Golub decomposition for linear programming bases