Solving staircase linear programs by the simplex method, 1: Inversion
From MaRDI portal
Cites work
- A Comparative Study of Two Methods for Staircase Linear Programs
- A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination
- A set of staircase linear programming test problems
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- A stabilization of the simplex method
- A Substitute Inverse for the Basis of a Staircase Structure Linear Program
- A TWO-LEVEL ALGORITHM FOR TWO-STAGE LINEAR PROGRAMS
- An alternative method for a global analysis of quadratic programs in a finite number of steps
- Decomposition Principle for Linear Programs
- Dynamic Linear Programs for Production Scheduling
- Evolution of linear programming computing techniques
- scientific article; zbMATH DE number 3657429 (Why is no real title available?)
- scientific article; zbMATH DE number 3538745 (Why is no real title available?)
- scientific article; zbMATH DE number 3354806 (Why is no real title available?)
- scientific article; zbMATH DE number 3371823 (Why is no real title available?)
- Matrix augmentation and structure preservation in linearly constrained control problems
- Nested Decomposition and Multi-Stage Linear Programs
- Nested decomposition for dynamic models
- On the Bartels—Golub decomposition for linear programming bases
- On the Number of Nonzeros Added when Gaussian Elimination is Performed on Sparse Random Matrices
- Optimal Solution of a Dynamic Leontief Model with Substitution
- Programming of Interdependent Activities: II Mathematical Model
- Reinversion with the preassigned pivot procedure
- Solving staircase linear programs by the simplex method, 1: Inversion
- Special Simplex Algorithm for Linked Problems
- Staircase Matrices and Systems
- Steepest Ascent for Large Scale Linear Programs
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- The elimination form of the inverse and its application to linear programming
- The simplex method of linear programming using LU decomposition
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
Cited in
(19)- An analysis of an available set of linear programming test problems
- Optimization with staircase structure: An application to generation scheduling
- A fast LU update for linear programming
- MOPS -- Mathematical optimization system
- Sensitivity method for basis inverse representation in multistage stochastic linear programming problems
- A clustering heuristic to detect staircase structures in large scale linear programming models
- Parallel decomposition of multistage stochastic programming problems
- Cascading-heuristics for the solution of staircase linear programs
- On recognizing staircase compatibility
- On a distributed implementation of a decomposition method for multistage linear stochastic programs
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Revised dantzig-wolfe decomposition for staircase-structured linear programs
- On scaling linear programs—some experimental results
- Solving staircase linear programs by the simplex method, 1: Inversion
- Solving staircase linear programs by the simplex method, 2: Pricing
- On the Combinatorial Diameters of Parallel and Series Connections
- A massively parallel interior-point method for arrowhead linear programs with local linking structure
- Parallel processors for planning under uncertainty
This page was built for publication: Solving staircase linear programs by the simplex method, 1: Inversion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3948887)
