Quantitative Techniques
A numerical subject, taught and examined almost entirely through formulation. Built from your course notes, the six lecture decks, five sets of class notes, and both 2025-26 question papers with their official answer keys.
Both 2025-26 papers ask the same eight question patterns from Units 1–3, worth 35 of the 50 marks. Q1 is compulsory and you choose any 4 of the remaining 6 — so these patterns alone can build a complete paper without touching game theory, queuing, simulation or decision theory.
And almost every one says "Formulate", not "solve". All 14 in-scope questions are worked in full → · 34 extra problems solved step by step →
Each concept runs: Understand → Method → Worked example → Common mistakes → Sources. Each solved paper question runs: original screenshot → full solution → marks breakdown from the official key.
Press / to search. Every citation — e.g. Notes p. 4 or QP p. 1 — opens the exact page in a panel on the right. ←/→ to page, Esc to close.
Syllabus Units
Revision & Practice
The eight recurring question patterns
| Slot | What it always is | Unit | Marks | Solved |
|---|---|---|---|---|
| Q1A | Convert primal to dual — always with one equality and one wrong-way constraint | 1 | 2.5 | Both versions |
| Q1B | Cost matrix → balanced? · number of constraints · number of variables | 3 | 2.5 | Both versions |
| Q3B | Formulate an LPP from a two-product, two-resource story | 1 | 5 | Both versions |
| Q4 (a) | Interpret a sensitivity report — five sub-questions | 1 | 5 | Both versions |
| Q4 (b) | Formulate an ILP — project selection with one logical constraint | 2 | 5 | Both versions |
| Q5B | Flight-pairing assignment problem | 3 | 5 | Both versions |
| Q7A | Identify the special case from a final simplex tableau | 1 | 5 | Final |
| Q7B | Transportation formulation, often with a profit twist | 3 | 5 | Final |
Scope of this portion
This site covers Units 1–3, which is exactly as far as your notes go. Units 4–7 (Theory of Games, Queuing, Simulation, Decision Theory) are in the syllabus and appeared in both papers, but no notes for them were supplied, so nothing has been invented for them.
One gap inside the covered range is flagged prominently: Unit 3's solution algorithms — NWCR, Least Cost, VAM, MODI and the Hungarian Method — are named in the session plan but are absent from every page of your notes. See the Unit 3 scope note and the References page.
What each unit is built from
| Unit | Course notes & decks | Your class notes | Exam questions |
|---|---|---|---|
| 01 — Linear Programming | Notes §1–5, 7–8 · LPP deck · Graphical · Special cases · Sensitivity & Duality | LP notes · Sensitivity · Note 2 | Q1A · Q3B · Q4 · Q7A |
| 02 — Integer Programming | Notes §6 · ILP deck | ILP notes · Note 2 pp. 19–21 | Q4B (Final) · Q4A (Re-Exam) |
| 03 — Transportation & Assignment | — none supplied — | Assignment notes · Note 2 pp. 12–18 | Q1B · Q5B · Q7B |
Unit and page references are taken from the course policy's session plan Policy pp. 6–8 and verified against the actual files.