Matrix augmentation and partitioning in the updating of the basis inverse
From MaRDI portal
Publication:4149218
DOI10.1007/BF01584341zbMath0372.90083MaRDI QIDQ4149218
Alexander Meeraus, Johannes Bisschop
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Stable algorithm for updating denseLUfactorization after row or column exchange and row and column addition or deletion, Canonical bases in linear programming, MSLiP: A computer code for the multistage stochastic linear programming problem, On the use of expert systems in network optimization: With an application to matrix balancing, Solving many linear programs that differ only in the right-hand side, On the use of dense matrix techniques within sparse simplex, Sensitivity method for basis inverse representation in multistage stochastic linear programming problems, The conical methodology and the evolution of simulation model development, An iterative working-set method for large-scale nonconvex quadratic programming, Solving linear programs with multiple right-hand sides: Pricing and ordering schemes, Hyper-sparsity in the revised simplex method and how to exploit it, Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem, A regularized decomposition method for minimizing a sum of polyhedral functions, A bump triangular dynamic factorization algorithm for the simplex method, Matrix augmentation and structure preservation in linearly constrained control problems, Matrix augmentation and partitioning in the updating of the basis inverse
Cites Work
- Generalized upper bounding techniques
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Matrix augmentation and partitioning in the updating of the basis inverse
- On the Bartels—Golub decomposition for linear programming bases
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- Methods for Modifying Matrix Factorizations
- The simplex method of linear programming using LU decomposition
- Reinversion with the preassigned pivot procedure
- Unnamed Item
- Unnamed Item
- Unnamed Item
