Topic summary · Student revision
Linear Programming (D1) Topic Review summary
Self-review linear programming for D1: formulation and graphical solution.
Files: Topic-Review-D1-Linear-Programming.pdf · Topic-Review-D1-Linear-Programming-Answers.pdf · free public downloads · diagrams in the PDFs
Key learning points
- Define variables and write all constraints including non-negativity.
- Sketch the feasible region accurately.
- Evaluate the objective at each vertex.
- Interpret the optimal solution in context (units, integer needs).
- Slack / surplus comments when the paper asks.
Worked example 1 — Vertex
Where is the optimum for a linear objective?
Working
Evaluate all vertices.
Worked example 2 — Integer
If items must be whole numbers?
Working
Graphical integer programming lite.
Worked example 3 — Practice point 1
Apply this idea from the Topic Review: Define variables and write all constraints including non-negativity.
Working
Attempt without notes, then check the answers PDF.
Worked example 4 — Practice point 2
Apply this idea from the Topic Review: Sketch the feasible region accurately.
Working
Attempt without notes, then check the answers PDF.
Scaffolded Learning Sheet and answers (PDFs)
This page is a short, searchable overview for revision and search engines. Use the Scaffolded Learning Sheet first, then the Answers PDF for a full written solution. The printable PDFs remain the main classroom resource.