Eliminating columns in the simplex method for linear programming
From MaRDI portal
Publication:1113797
DOI10.1007/BF00940732zbMath0661.90055MaRDI QIDQ1113797
Publication date: 1989
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
simplex method; pricing criterion; column elimination; column-eliminating technique; nonbasic variables; primal and dual methods
Cites Work
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- A ``build-down scheme for linear programming
- Karmarkar's algorithm and the ellipsoid method
- Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
- New criteria for the simplex algorithm
- Generalized theorems for permanent basic and nonbasic variables