Pages that link to "Item:Q1121785"
From MaRDI portal
The following pages link to Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples (Q1121785):
Displayed 6 items.
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- An exterior point simplex algorithm for (general) linear programming problems (Q1312781) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- Resolution of the problem of degeneracy in a primal and dual simplex algorithm (Q1374385) (← links)
- An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522) (← links)