Linear Programming: The Two Stage Simplex and the Big-M Algorithms

These two PowerPoint presentations fully explain the ideas behind the
Two-Stage Simplex and the Big-M Algorithms.

They both provide clear, animated, step-by-step examples explaining how to apply the algorithms.

[ I have also separately uploaded a free preview so that you can see the style of the presentation. ]

Slack, surplus and artificial variables are explained, as is the creation of the additional objective function (i.e. A = “The total of the artificial variables”), and the modification of the original objective function when using the Big-M method.

The slides can be used as the basis for teaching the topic to an A-Level mathematics class, and they also clear enough to be used as a revision/self-study aid.

For example, "triggers " are used to show how values within a tableau are calculated using row operations on the previous tableau.

Extensive use has been made of PowerPoint’s animation features such as “appear”, “fade” etc…

I hope this resource will be useful within your teaching, and I would happy to receive any feedback that you might have.

Regards and best wishes

Gerard