Reinversion with the preassigned pivot procedure

Cites work

scientific article; zbMATH DE number 3179979 (Why is no real title available?)
scientific article; zbMATH DE number 3354790 (Why is no real title available?)
On an Approach to Techniques for the Analysis of the Structure of Large Systems of Equations
The elimination form of the inverse and its application to linear programming

Cited in

(30)

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
A manifold-based approach to sparse global constraint satisfaction problems
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
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
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
A survey of direct methods for sparse linear systems
The basis suppression method
Network reoptimization procedures for multiobjective network problems

This page was built for publication: Reinversion with the preassigned pivot procedure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659039)