Pages that link to "Item:Q4158808"
From MaRDI portal
The following pages link to On the Bartels—Golub decomposition for linear programming bases (Q4158808):
Displayed 9 items.
- A quasi-Newton method with modification of one column per iteration (Q798571) (← links)
- A practicable steepest-edge simplex algorithm (Q3887219) (← links)
- An implementation of the simplex method for linear programming problems with variable upper bounds (Q3934132) (← links)
- Solving staircase linear programs by the simplex method, 1: Inversion (Q3948887) (← links)
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases (Q3955153) (← links)
- Matrix augmentation and partitioning in the updating of the basis inverse (Q4149218) (← links)
- Large-scale linearly constrained optimization (Q4162963) (← links)
- Solving staircase linear programs by the simplex method, 2: Pricing (Q4744058) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)