Use the result of the previous problem to show that the

Question

Question: Use the result of the previous problem to show that the Klee-Minty problem requires 2n - 1 iterations.

Problem: Compare the performance of the largest-coefficient and the smallest-index pivoting rules on the following linear program:

maximize   2x₁ + x₂

subject to   3x₁ + x₂ ≤ 3

                        x₁, x_{2 ≥ 0.}