An implementation of the simplex method for linear programming problems with variable upper bounds
From MaRDI portal
Publication:3934132
DOI10.1007/BF01583778zbMath0477.90039OpenAlexW2037499637MaRDI QIDQ3934132
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01583778
Related Items
Exploiting special structure in Karmarkar's linear programming algorithm, An Implementation of Variable Upper Bounds via SUB Methodology, Dual simplex algorithm with implicit representation of variable upper bounds, Fast bounding procedures for large instances of the simple plant location problem, Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage, An aggressive reduction scheme for the simple plant location problem, A solver for the multi-objective transshipment problem with facility location, Large-scale linear programming: Geometry, working bases and factorizations, Selected bibliography on degeneracy, Bounded isotonic median regression
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A stabilization of the simplex method
- A numerically stable form of the simplex algorithm
- Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths
- Methods for Computing and Modifying the LDV Factors of a Matrix
- Compact LP bases for a class of IP problems
- On the Bartels—Golub decomposition for linear programming bases
- Implicit representation of generalized variable upper bounds in linear programming
- A note on Schrage's generalised variable upper bounds
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- The Composite Simplex Algorithm
- The simplex method of linear programming using LU decomposition
