docx, 182.1 KB
docx, 182.1 KB
xlsm, 83.08 KB
xlsm, 83.08 KB
The first resource guides your students through the whole process of using the Simplex algorithm to solve a linear programming problem.

The first page explains how the initial tableau is formed, how the objective function must be written and how the inequalities that represent constraints must be written as equations with the introduction of slack variables.

The first exercise (11 questions) gives them the opportunity to practise writing the initial tableau correctly for different problems. Grids are provided so students focus their time and energy on only the values in the tableau.

The next section describes how an iteration of the algorithm is performed and links the iterations to the graphical solution, showing how each iteration moves to a different vertex of the feasible region.

There is then another exercise with 10 questions for students to practise performing iterations and finding the optimal solution. Again, grids are provided so students focus their time and energy on only the steps of the algorithm and the values in the tableau.

Fully worked solutions are provided to all the questions in the exercises.

The second resource is a spreadsheet that automatically solves any simplex tableau in 2/3 variables with 2/3 constraints - a useful resource for doing/checking solutions to other questions from a textbook or examination paper.

Reviews

Something went wrong, please try again later.

This resource hasn't been reviewed yet

To ensure quality for our reviews, only customers who have purchased this resource can review it

Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.