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)
65K05: Numerical mathematical programming methods
Related Items
On a dual method for a specially structured linear programming problem with application to stochastic programming, Updated triangular factors of the basis to maintain sparsity in the product form simplex method, The basis suppression method, Network reoptimization procedures for multiobjective network problems, Intelligent gradient search in linear programming, Implementation of successive linear programming algorithms for non-convex goal programming, An implementation of linear and nonlinear multicommodity network flows, On the use of dense matrix techniques within sparse simplex, Ordering algorithms for irreducible sparse linear systems, Sensitivity method for basis inverse representation in multistage stochastic linear programming problems, 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, Maintaining LU factors of a general sparse matrix, A pathological case in the reduction of linear programs, Improving the numerical stability and the performance of a parallel sparse solver, CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems, A bump triangular dynamic factorization algorithm for the simplex method, A degeneracy exploiting LU factorization for the simplex method, Identification of special structure constraints in linear programs, Solving staircase linear programs by the simplex method, 1: Inversion, A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases, Determining GUB sets via an invert agenda algorithm, The factorization approach to large-scale linear programming, Hierarchical partition—a new optimal pivoting algorithm, Matrix augmentation and partitioning in the updating of the basis inverse, Large-scale linearly constrained optimization
Cites Work
