Pages that link to "Item:Q4777052"
From MaRDI portal
The following pages link to Updated triangular factors of the basis to maintain sparsity in the product form simplex method (Q4777052):
Displaying 50 items.
- Mixed integer programming: A historical perspective with Xpress-MP (Q537574) (← links)
- The double pivot simplex method (Q684156) (← links)
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349) (← links)
- Vector processing in simplex and interior methods for linear programming (Q751499) (← links)
- Numerical behavior of LP algorithms based upon the decomposition principle (Q760768) (← links)
- An efficient approach to updating simplex multipliers in the simplex algorithm (Q927163) (← links)
- A sparse counterpart of Reichel and Gragg's package QRUP (Q1044853) (← links)
- On the use of the simplex algorithm for the absolute deviation curve fitting problem (Q1056519) (← links)
- A stable and sparsity exploiting LU factorization of the basis matrix in linear programming (Q1067993) (← links)
- A dual approach to primal degeneracy (Q1102188) (← links)
- The simplex method is not always well behaved (Q1109528) (← links)
- Number of operations for updating the elimination form of the basis- inverse of the revised simplex-algorithm (Q1244166) (← links)
- Optimization with staircase structure: An application to generation scheduling (Q1263534) (← links)
- On the use of dense matrix techniques within sparse simplex (Q1309853) (← links)
- A fast LU update for linear programming (Q1309856) (← links)
- MOPS -- Mathematical optimization system (Q1317161) (← links)
- Sensitivity method for basis inverse representation in multistage stochastic linear programming problems (Q1321212) (← links)
- On the efficacy of distributed simplex algorithms for linear programming (Q1342885) (← links)
- Parallelizing the dual revised simplex method (Q1646685) (← links)
- Steepest-edge simplex algorithms for linear programming (Q1802952) (← links)
- Numerical aspects in developing LP softwares, LPAKO and LPABO (Q1872947) (← links)
- A two-phase support method for solving linear programs: numerical experiments (Q1954826) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- Rank revealing Gaussian elimination by the maximum volume concept (Q1987003) (← links)
- A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
- Novel update techniques for the revised simplex method (Q2352418) (← links)
- Parallel distributed-memory simplex for large-scale stochastic LP problems (Q2393649) (← links)
- Hyper-sparsity in the revised simplex method and how to exploit it (Q2490370) (← links)
- An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
- Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
- Stable modification of explicitLU factors for simplex updates (Q3692731) (← links)
- A bump triangular dynamic factorization algorithm for the simplex method (Q3865837) (← links)
- A practicable steepest-edge simplex algorithm (Q3887219) (← links)
- An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming (Q3922472) (← links)
- An implementation of the simplex method for linear programming problems with variable upper bounds (Q3934132) (← 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)
- Updated triangular factors of the working basis in winkler's decomposition approach (Q3964320) (← links)
- Experiments in mixed-integer linear programming using pseudo-costs (Q4136935) (← links)
- Matrix augmentation and partitioning in the updating of the basis inverse (Q4149218) (← links)
- Matrix factorizations in optimization of nonlinear functions subject to linear constraints (Q4152044) (← links)
- On the Bartels—Golub decomposition for linear programming bases (Q4158808) (← links)
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results (Q4165158) (← links)
- On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation (Q4184647) (← links)
- Stable algorithm for updating dense<i>LU</i>factorization after row or column exchange and row and column addition or deletion (Q4327873) (← links)
- On pricing and backward transformation in linear programming (Q4404659) (← links)
- Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
- On a dual method for a specially structured linear programming problem with application to stochastic programming (Q4709734) (← links)
- LPAKO: A Simplex-based Linear Programming Program (Q4709753) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
