Simplex Algorithm - Further maths A level A2 Discrete

Simplex Algorithm topics covers;

• Identify when the simplex algorithm should be applied (ie for situations that have three or more basic variables)
• Introduce and use slack variables to convert inequalities into equalities (only less than or equal to inequalities will be used during assessment)
• Use the simplex algorithm to maximise an objective function subject to linear constraints
• Use the simplex algorithm to minimise an objective function P by maximising the objective function Q = –P
• understand and use the stopping condition for the simplex algorithm (ie the objective row being non-negative)
• Find the optimal value of the objective function from a simplex tableau
• Identify any basic or slack variables that have zero values
• Find the values of any basic or slack variables that have non-zero values
• Interpret a Simplex tableau at any stage of the algorithm.
• Convert higher order games to linear programming problems and solve using the Simplex algorithm

These PowerPoints form full lessons of work that together cover the full A level Further Maths course for the AQA exam board. Together all the PowerPoints include;
• A complete set of notes for students
• Model examples
• Probing questions to test understanding
• Class questions including answers
• Individual whiteboard work
• Links to exercises in ‘AQA approved textbooks by Hodder ed’ these can easily be edited for your textbook
The PowerPoints can be used in the lesson and also given to students that have missed a lesson
Videos of the lessons are all on You Tube so you can see the PowerPoint lessons fully first
Please leave a review as it will really help me to improve my resources