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¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:83ea4564a988 · see in the full table