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: