NivaarExam PrepOfficial exam papers ↗

23-Ind-A1 Operations Research: May 2013

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

  1. Question 1 LP Formulation — Minimum-Cost Fuel Purchase for a Circular Flight Route
  2. Question 2 Simplex Method and Sensitivity Analysis
  3. Question 3 Minimum-Cost Network Flow — Napkin Procurement Over 5 Days
  4. Question 4 Integer Programming — Power-Plant Site Selection and Timing
  5. Question 5 Dynamic Programming — Single-Machine Job Sequencing to Minimize Tardiness Cost
  6. Question 6 Decision Analysis — Pipeline Weld Inspection (EMV and Value of Sample Information)
  7. Question 7 Probabilistic Dynamic Programming — The Parking-Space Problem
  8. Question 8 Queueing Theory — Tool-Crib Attendant Staffing
  9. Question 9 LP Formulation — Multi-Modal Wheat Shipment to Rotterdam

Start with Question 1 →

National Exams — May 2013 — 98-Ind-A1 Operations Research. Three-hour, open-book exam (any non-communicating calculator permitted); the paper totals 180 marks across 9 questions and only 100 marks are required, so a candidate would normally answer a subset — all nine are solved below for completeness.

Reference texts: Hillier & Lieberman, Introduction to Operations Research (11th ed., McGraw-Hill) — linear/integer programming, network optimization, dynamic programming, decision analysis and queueing theory; Niebel & Freivalds, Niebel's Methods, Standards, and Work Design (13th ed.) — job-shop sequencing context.