Reinversion with the preassigned pivot procedure
From MaRDI portal
Publication:5659039
DOI10.1007/BF01584086zbMath0246.65022MaRDI QIDQ5659039
Dennis C. Rarick, Eli Hellerman
Publication date: 1971
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Dynamic factorization in large-scale optimization, On the efficacy of distributed simplex algorithms for linear programming, A locally optimized reordering algorithm and its application to a parallel sparse linear system solver, Implementation of successive linear programming algorithms for non-convex goal programming, Improving the numerical stability and the performance of a parallel sparse solver, A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations, CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems, Determining GUB sets via an invert agenda algorithm, The basis suppression method, Network reoptimization procedures for multiobjective network problems, The factorization approach to large-scale linear programming, Hierarchical partition—a new optimal pivoting algorithm, A survey of direct methods for sparse linear systems, A manifold-based approach to sparse global constraint satisfaction problems, Matrix augmentation and partitioning in the updating of the basis inverse, A bump triangular dynamic factorization algorithm for the simplex method, Large-scale linearly constrained optimization, A degeneracy exploiting LU factorization for the simplex method, On a dual method for a specially structured linear programming problem with application to stochastic programming, An implementation of linear and nonlinear multicommodity network flows, Maintaining LU factors of a general sparse matrix, Identification of special structure constraints in linear programs, A pathological case in the reduction of linear programs, On the use of dense matrix techniques within sparse simplex, Ordering algorithms for irreducible sparse linear systems, Solving staircase linear programs by the simplex method, 1: Inversion, A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases, Intelligent gradient search in linear programming, Sensitivity method for basis inverse representation in multistage stochastic linear programming problems, Updated triangular factors of the basis to maintain sparsity in the product form simplex method
Cites Work
