Recommendations
Cites work
Cited in
(13)- An efficient simplex type algorithm for sparse and dense linear programs.
- A regularized simplex method
- The sagitta method for solving linear programs
- A simplex-like method with bisection for linear programming1
- On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method
- Exterior point simplex-type algorithms for linear and network optimization problems
- scientific article; zbMATH DE number 721852 (Why is no real title available?)
- A phase-1 approach for the generalized simplex algorithm
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
- Simplex method and groups generated by reflections
- scientific article; zbMATH DE number 3898608 (Why is no real title available?)
- Pivoting in an outcome polyhedron
- scientific article; zbMATH DE number 3852781 (Why is no real title available?)
This page was built for publication: The generalized simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1195877)