The authors define polytopes in locally convex spaces such that the simplex method converges to optimality and all such polytopes have exposed extreme points joined by edge paths, capturing optimization over the Hilbert cube.
Cambridge University Press Cambridge, 2010
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A geometric simplex method in infinite-dimensional spaces
The authors define polytopes in locally convex spaces such that the simplex method converges to optimality and all such polytopes have exposed extreme points joined by edge paths, capturing optimization over the Hilbert cube.