Grade 12 Chapter 6 – Linear Programming

Linear programming is about using straight line graphs to optimise (in other words find the maximum or minimum) solution for a number of constraints. We show how to find the constraints, how to draw the constraints onto the Cartesian plane and how to find the profit or loss. There are lots of great examples for you to use to practice from.

Download here:

Chapter 6 – Linear Programming