Course folder

3.2 Linear programming

Welcome to the 2020 edition of 3.2 Linear Programming at Takapuna Grammar School. It is a 4 week course that ends with an internal exam. Below you have an outline of the skills and concepts covered. To the left (or below on a small screen) you have the course drive with resources such as theory notes and administrative information.

Exam content

Practice exam : Olivia's orchard. Solution, Video tutorial for achieved, merit and excellence.

Previous exams (example): Ted's tomatoes. Solution

Previous exams (example): Zenon's xylophones


Curriculum content

How to use Desmos

Identify and evaluate equations at critical points of the feasible region

Identify constraints and turn them into in-equations

Determine the optimal outcomes of a range of different optimisation problems

Make explicit recommendations based on your findings

Reformulate real world problem into linear optimisation problems

Determine the optimal outcomes of a range of different optimisation problems

Identify feasible whole point solutions in the vicinity of critical points

Identify multiple solutions

Analyse how changes in constraints affect optimal solutions.

How to use the gradient of constraints and the objective function to determine the existence of multiple solutions.

Create and solve your own linear programming problems.