Matrix augmentation and partitioning in the updating of the basis inverse
From MaRDI portal
Publication:4149218
DOI10.1007/BF01584341zbMath0372.90083OpenAlexW1996706223MaRDI QIDQ4149218
Alexander Meeraus, Johannes Bisschop
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584341
Related Items
Solving many linear programs that differ only in the right-hand side, A regularized decomposition method for minimizing a sum of polyhedral functions, Parallel distributed-memory simplex for large-scale stochastic LP problems, Solving linear programs with multiple right-hand sides: Pricing and ordering schemes, An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix, Stable algorithm for updating denseLUfactorization after row or column exchange and row and column addition or deletion, Canonical bases in linear programming, AMPS: An Augmented Matrix Formulation for Principal Submatrix Updates with Application to Power Grids, 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, Hyper-sparsity in the revised simplex method and how to exploit it, A dual gradient-projection method for large-scale strictly convex quadratic problems, Matrix augmentation and partitioning in the updating of the basis inverse, A bump triangular dynamic factorization algorithm for the simplex method, Matrix augmentation and structure preservation in linearly constrained control problems, Application of Sherman-Morrison formula in adaptive analysis by BEM, The conical methodology and the evolution of simulation model development, On the use of dense matrix techniques within sparse simplex, An iterative working-set method for large-scale nonconvex quadratic programming, Novel update techniques for the revised simplex method, Sensitivity method for basis inverse representation in multistage stochastic linear programming problems, Methods for convex and general quadratic programming, Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
