The following shows a display for each iteration of the
primal simplex for the example problem. Starting from the
Northwest Corner solution we reach the
optimum solution after 10 iterations.
We know that the final
solution is optimum because all the reduced costs are nonnegative.
A restart button is provided on the worksheet so the problem
can be run again.
Operations Research Models and Methods
by Paul A. Jensen
Copyright 2004 - All rights reserved