Welcome to the Simplex Place!

Inn this discussion we examine the Simplex Method from the vantage point of the good old Gaussian elimination procedure for the solution of systems of linear equations. It is assumed that you are familiar with the basic structure of Linear Programming Problems and the theory of linear programming.

We shall go through each step of the "textbook" version of the primal simplex method and then summarise the procedure as a recipe. At the end of the tour we shall experiment with our beloved interactive simplex engine. It will be a long tour.

In fact, this module is not complete yet! It is expected that eventually it will consist of something like 8 submodules (only four are operational at present).

How to use this module:

© The University of Melbourne 1994-2000.
Disclaimer and Copyright Information.
Conditions of use.

Date created: January 15, 2000
Date last modified: February 15, 2000
Authorised by: Moshe Sniedovich
Maintained by: Moshe Sniedovich, Department of Mathematics and Statistics.
Email: m.sniedovich@ms.unimelb.edu.au