Simplex Challenge -- Klee-Minty

Your Name:

constraints: ,   variables: ,      

    Number format:

Current Dictionary:



  Problem number:   Total pivots:   Time:

This app will present a Klee-Minty-type linear programming problem for you to solve. The Klee-Minty problem is to be solved using the Simplex Method with the largest-coefficient rule.

In this applet, \(\sf \beta_1, \; \beta_2, \; \beta_3, \; \beta_4 \) are again components of the constant terms in each row (see the text p.44), but this time they are really part of the problem and not perturbations to it. As in the previous case, in order to figure out the leaving variables, you need to remember the ordering; this time \(\sf \beta_1 \ll \beta_2 \ll \beta_3 \ll \beta_4. \) The coefficients used are powers of 10 in the book and powers of 2 in the tool.

The particular Klee-Minty problem is determined by specifying the number of constraints in the problem. Your instructor will tell you what value to use. In this exercise, the correct final score is \(\sf 2^m-1\), where \(\sf m \) denotes the number of constraints in the problem.

When you are ready to begin, press the Go Pivoting button.

Don't forget that incorrectly pressing the termination button, Optimal, counts as an extra pivot, so press this button only when you are confident that it is the correct thing to do.

Final note: if for any reason you wish to start over, you may reload the window. You can then start afresh. Of course, at some time before this online assignment is due you must go to the end and submit a score.

Note: click here for the Java Applet version of the same tool.