Linear Programming: Feasible Regions and Optimisation

Graph a single linear inequality (e.g. $y \le 2x + 3$) on a set of axes, shading the correct side of the boundary line.

Worksheet Builder All resources ☕ Shout us a flat white Download All

Te reo Māori terms

click each term to open in Te Aka

Learning objective overview

Master Teaching Guide coverage for this objective.

Current NZC (2007)
  • NA6-4
  • NA6-5
New NZC (2026)
  • NZC26-P4-ALG-ER-P-Y10-02

Resources

Terminology

  • Linear inequality
  • Feasible region
  • Boundary line
  • Vertex
  • Constraint
  • Objective function
  • Optimisation
  • Maximum
  • Minimum

Task goals

  • Foundation: Graph a single linear inequality (e.g. $y \le 2x + 3$) on a set of axes, shading the correct side of the boundary line.
  • Proficient: Graph a system of two or three linear inequalities together to identify and shade the bounded feasible region, then list the coordinates of its vertices.
  • Excellence: Given a real-world constraint scenario, form the system of inequalities, graph the feasible region, and evaluate a given objective function at each vertex to determine the optimal (maximum or minimum) solution.

Where this fits

What leads into this objective, and where it goes next.

You are here

Linear Programming: Feasible Regions and Optimisation

Linear Programming: Feasible Regions and Optimisation

Next

Year 10 is the last year of this phase — the curriculum lists nothing after this. No extension resources on the site yet.

Explore the whole sequence →