Quantitative Techniques
The full Term End syllabus — all seven units — built from your course notes, the lecture decks, the Decision Theory lecture, your class notes, all ten assignments, and both 2025-26 question papers with their official answer keys.
- Solved Assignments 1–10 — all 53 problems, each with the method, a shortcut, and the full working.
- Solved Papers — every one of the 30 question parts in both 2025-26 papers, checked against the keys (four key errors flagged).
- The two most mechanical big-mark questions: Q2 simulation (10 marks) and Q6 decision theory (5 + 5) — pure procedure once practised.
Each concept runs: Understand → Method → Worked example → Common mistakes → Sources. Each assignment page opens with a method card and a tricks card, then every problem as question → numbered steps → answer.
Press / to search. Every citation — e.g. Lecture p. 13 or QP p. 1 — opens the exact page in a panel on the right. ←/→ to page, Esc to close.
Syllabus Units
Assignments & Revision
The paper, slot by slot
Both 2025-26 papers had the same shape. Every slot below is solved for both papers:
| Slot | What it always is | Unit | Marks | Solved |
|---|---|---|---|---|
| Q1A | Convert primal to dual — always one equality and one wrong-way constraint | 1 | 2.5 | Both papers |
| Q1B | Cost matrix → balanced? · constraints · variables | 3 | 2.5 | Both papers |
| Q1C | AHP priorities from a pairwise matrix | 7 | 2.5 | Both papers |
| Q1D | Payoff matrix; Maximin/Maximax or Laplace | 7 | 2.5 | Both papers |
| Q2 | Monte Carlo simulation — queue or production/lorry | 6 | 10 | Both papers |
| Q3A | Zero-sum game payoff matrix | 4 | 5 | Both papers |
| Q3B | Formulate an LPP from a two-product story | 1 | 5 | Both papers |
| Q4 | Sensitivity report + formulate an ILP | 1, 2 | 5 + 5 | Both papers |
| Q5A | M/M/1 queue parameters and the effect of more arrivals | 5 | 5 | Both papers |
| Q5B | Flight-pairing assignment problem | 3 | 5 | Both papers |
| Q6A | Decision tree with EMV (survey data in the Re-Exam) | 7 | 5 | Both papers |
| Q6B | Hurwicz criterion with a given α | 7 | 5 | Both papers |
| Q7 | Special case from a final tableau + transportation with a profit twist | 1, 3 | 5 + 5 | Both papers |
What each unit is built from
| Unit | Lecture material | Assignment | Exam questions |
|---|---|---|---|
| 01 — Linear Programming | Notes · LPP · Graphical · Special cases · Sensitivity & Duality | A1–A4 | Q1A · Q3B · Q4 · Q7 |
| 02 — Integer Programming | ILP deck · class notes | A10 | Q4 |
| 03 — Transportation & Assignment | class notes · Note 2 | A6 | Q1B · Q5B · Q7 |
| 04 — Theory of Games | no deck supplied — session plan + assignment | A7 | Q3A |
| 05 — Queuing | no deck supplied — session plan + assignment | A5 | Q5A |
| 06 — Simulation | no deck supplied — session plan + assignment + keys | A9 | Q2 |
| 07 — Decision Theory & AHP | Decision Theory lecture (26 pp.) | A7 · A8 | Q1C · Q1D · Q6 |
Units 4–6 had no lecture deck among your files, so their notes follow the session plan's topics and textbook sections Policy pp. 7–8, the assignments, and the method the official answer keys use. Unit references are from the session plan Policy pp. 6–9.