Pages that link to "Item:Q5659039"

The following pages link to Reinversion with the preassigned pivot procedure (Q5659039):

Displaying 30 items.

• The basis suppression method (Q918407) (← links)
• Network reoptimization procedures for multiobjective network problems (Q918434) (← links)
• Intelligent gradient search in linear programming (Q1071647) (← links)
• Implementation of successive linear programming algorithms for non-convex goal programming (Q1093528) (← links)
• An implementation of linear and nonlinear multicommodity network flows (Q1268228) (← links)
• On the use of dense matrix techniques within sparse simplex (Q1309853) (← links)
• Ordering algorithms for irreducible sparse linear systems (Q1309854) (← links)
• Sensitivity method for basis inverse representation in multistage stochastic linear programming problems (Q1321212) (← links)
• Dynamic factorization in large-scale optimization (Q1330893) (← links)
• On the efficacy of distributed simplex algorithms for linear programming (Q1342885) (← links)
• A locally optimized reordering algorithm and its application to a parallel sparse linear system solver (Q1343678) (← links)
• Maintaining LU factors of a general sparse matrix (Q1822448) (← links)
• A pathological case in the reduction of linear programs (Q1837107) (← links)
• Improving the numerical stability and the performance of a parallel sparse solver (Q1905913) (← links)
• A manifold-based approach to sparse global constraint satisfaction problems (Q2010101) (← links)
• A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations (Q2408155) (← links)
• CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems (Q3221769) (← links)
• A bump triangular dynamic factorization algorithm for the simplex method (Q3865837) (← links)
• A degeneracy exploiting LU factorization for the simplex method (Q3885512) (← links)
• Identification of special structure constraints in linear programs (Q3920989) (← links)
• Solving staircase linear programs by the simplex method, 1: Inversion (Q3948887) (← links)
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases (Q3955153) (← links)
• Determining GUB sets via an invert agenda algorithm (Q4048848) (← links)
• The factorization approach to large-scale linear programming (Q4096702) (← links)
• Hierarchical partition—a new optimal pivoting algorithm (Q4127869) (← links)
• Matrix augmentation and partitioning in the updating of the basis inverse (Q4149218) (← links)
• Large-scale linearly constrained optimization (Q4162963) (← links)
• On a dual method for a specially structured linear programming problem with application to stochastic programming (Q4709734) (← links)
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method (Q4777052) (← links)
• A survey of direct methods for sparse linear systems (Q5740079) (← links)