NivaarExam PrepOfficial exam papers ↗

23-Ind-A1 Operations Research: May 2017

Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)

  1. Question 1 Minimum-Cost Network Flow — Napkin Procurement
  2. Question 2 Dynamic Programming — Shortest Path Through a Street Grid
  3. Question 3 Decision Analysis with Sample Information — Pollution Patrol
  4. Question 4 LP Formulation — Post Office Workforce Scheduling
  5. Question 5 LP Sensitivity Analysis from a Given Final Simplex Tableau
  6. Question 6 Markov Steady State — Textbook Buyback Cycle
  7. Question 7 LP Formulation — Airline Fuel-Purchasing (Tankering)
  8. Question 8 Integer Programming — Mutual Fund Allocation with Disjunctive Rules

Start with Question 1 →

National Exams — May 2017 — 98-Ind-A1 Operations Research. Three-hour, open-book exam (any non-communicating calculator permitted); the paper totals 160 marks across 8 questions (each worth 20) and only 100 marks are required, so a candidate would normally answer 5 — all eight are solved below for completeness.

Reference texts: Hillier & Lieberman, Introduction to Operations Research (11th ed., McGraw-Hill) — linear programming formulation & the simplex method (ch. 3–4), duality & sensitivity analysis (ch. 6), network optimization models (ch. 9), deterministic dynamic programming (ch. 11), integer programming (ch. 12), Markov chains (ch. 16), decision analysis (ch. 15).