The Klee-Minty problem is a linear-programming problem designed to demonstrate that a problem exists that would require the simplex algorithm to generate all extreme point solutions before finding the optimal. This problem demonstrated that, although the simplex algorithm (under a nondegeneracy assumption) would find an optimal solution in a finite number of iterations, the number of iterations can increase exponentially. Thus, the simplex method is not a polynomially bounded algorithm. One form of the Klee-Minty problem, which defines a slightly perturbed hypercube, is the following:
with 0 < ∈ < 1/2.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Klee-minty problem . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_499
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_499
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive