constraints = ,   variables = .   seed = ,   no. of probs: ,
Problem number:   Total pivots:   Time:
The applet above will present you a set of linear programming problems to solve. You're job is to solve each problem (either by finding an optimal solution or demonstrating that the problem is infeasible or unbounded). After correctly solving a problem, the applet will immediately give you a new one. After you have solved all the problems in the set, make a screen shot of this webpage and email that to your instructor.
Each problem must be solved using the Dual-Phase-I Primal-Phase-II simplex method. Any attempt to make an incorrect pivot will be rejected but your score will be increased by one. As always, low scores are better than high scores. Within each phase you may use any pivot rule you like (i.e., largest coefficient, smallest index, etc.).
The set of linear programming problems to be solved is determined by specifying the number of rows, the number of columns, the seed, and the number of problems in the set. Your instructor will tell you what values to use for these fields. Make sure that you enter exactly what your instructor tells you for otherwise you will be doing a different set of problems and it will be impossible to fairly evaluate your performance.
When you are ready to begin the challenge, press the Go Pivoting button.
Don't forget that pressing the Undo button counts as an extra pivot in your score---it does not reduce the pivot count. Also, incorrectly pressing one of the termination buttons (Optimal, Unbounded, or Infeasible) counts as an extra pivot, so press these buttons 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 press your browser's reload button to start over. Of course, at some time before the established deadline you must go to the end and submit a screenshot.
Finally, click here for the Java Applet version of this tool.