The generalized simplex method
From MaRDI portal
Recommendations
Cites work
Cited in
(13)- A phase-1 approach for the generalized simplex algorithm
- Exterior point simplex-type algorithms for linear and network optimization problems
- Simplex method and groups generated by reflections
- Pivoting in an outcome polyhedron
- A regularized simplex method
- scientific article; zbMATH DE number 3852781 (Why is no real title available?)
- scientific article; zbMATH DE number 721852 (Why is no real title available?)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
- The sagitta method for solving linear programs
- An efficient simplex type algorithm for sparse and dense linear programs.
- On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method
- A simplex-like method with bisection for linear programming1
- scientific article; zbMATH DE number 3898608 (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)