How good is the simplex algorithm?¶
Klee, V., & Minty, G. J. (1972). How good is the simplex algorithm?. Inequalities III.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Linear Programming (LP)
- In mathematics, LP is the study of optimization over polytopes, with connections to polyhedral geometry, combinatorial optimization, and convex analysis — the simplex pivoting and worst-case analyses of Bland (1977) and Klee and Minty (1972) sit at the boundary between these algebraic and combinatorial views.
This source(Klee–Minty cube; simplex worst-case exponential complexity.)
- In mathematics, LP is the study of optimization over polytopes, with connections to polyhedral geometry, combinatorial optimization, and convex analysis — the simplex pivoting and worst-case analyses of Bland (1977) and Klee and Minty (1972) sit at the boundary between these algebraic and combinatorial views.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:83ea4564a988 · see in the full table