Updated triangular factors of the basis to maintain sparsity in the product form simplex method
From MaRDI portal
Publication:4777052
DOI10.1007/BF01584548zbMath0288.90048OpenAlexW1979154120MaRDI QIDQ4777052
No author found.
Publication date: 1972
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584548
Related Items
Numerical aspects in developing LP softwares, LPAKO and LPABO, Updated triangular factors of the working basis in winkler's decomposition approach, On the efficacy of distributed simplex algorithms for linear programming, A dual approach to primal degeneracy, Parallelizing the dual revised simplex method, The simplex method is not always well behaved, Parallel distributed-memory simplex for large-scale stochastic LP problems, Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates, Stable algorithm for updating denseLUfactorization after row or column exchange and row and column addition or deletion, A two-phase support method for solving linear programs: numerical experiments, An efficient approach to updating simplex multipliers in the simplex algorithm, Permutations in the Factorization of Simplex Bases, A projective simplex algorithm using LU decomposition, Rank revealing Gaussian elimination by the maximum volume concept, Improving a primal–dual simplex-type algorithm using interior point methods, The double pivot simplex method, Mixed integer programming: A historical perspective with Xpress-MP, A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses, A survey of direct methods for sparse linear systems, Hyper-sparsity in the revised simplex method and how to exploit it, Experiments in mixed-integer linear programming using pseudo-costs, On pricing and backward transformation in linear programming, Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage, Matrix augmentation and partitioning in the updating of the basis inverse, Matrix factorizations in optimization of nonlinear functions subject to linear constraints, A bump triangular dynamic factorization algorithm for the simplex method, On the Bartels—Golub decomposition for linear programming bases, Number of operations for updating the elimination form of the basis- inverse of the revised simplex-algorithm, The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results, A practicable steepest-edge simplex algorithm, Steepest-edge simplex algorithms for linear programming, On a dual method for a specially structured linear programming problem with application to stochastic programming, LPAKO: A Simplex-based Linear Programming Program, Optimization with staircase structure: An application to generation scheduling, On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation, Vector processing in simplex and interior methods for linear programming, A triangulation and fill-reducing initialization procedure for the simplex algorithm, Numerical behavior of LP algorithms based upon the decomposition principle, An affine-scaling pivot algorithm for linear programming, An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming, A sparse counterpart of Reichel and Gragg's package QRUP, Large-scale linear programming: Geometry, working bases and factorizations, An implementation of the simplex method for linear programming problems with variable upper bounds, On the use of the simplex algorithm for the absolute deviation curve fitting problem, On the use of dense matrix techniques within sparse simplex, A fast LU update for linear programming, Solving staircase linear programs by the simplex method, 1: Inversion, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, MOPS -- Mathematical optimization system, A stable and sparsity exploiting LU factorization of the basis matrix in linear programming, Novel update techniques for the revised simplex method, A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases, Sensitivity method for basis inverse representation in multistage stochastic linear programming problems, Stable modification of explicitLU factors for simplex updates
Cites Work
- Unnamed Item
- The Elimination form of the Inverse and its Application to Linear Programming
- Evolution of Linear Programming Computing Techniques
- The simplex method of linear programming using LU decomposition
- On the Product Form of Inverses of Sparse Matrices
- Some Results on Sparse Matrices
- Reinversion with the preassigned pivot procedure
- Maintaining a Sparse Inverse in the Simplex Method
