NivaarExam Prep

23-Ind-A1 Operations Research

Worked solutions to 10 past sittings (2013–2019), 91 questions. Pick a sitting, or start from a topic below.

Topics across the sittings

Topics that come up in more than one sitting, taken from the headings of our worked solutions. A topic counts once per sitting.

Questions by sitting

December 2019

  1. Question 1: Newsvendor Model — Christmas Tree Order Quantity
  2. Question 2: Finite-Capacity Queueing — Should the Jewellery Store Add a Second Parking Spot?
  3. Question 3: Equipment Replacement — Six-Year Car Ownership Policy
  4. Question 4: Decision Analysis with Sample Information — The Don Harnett Story
  5. Question 5: LP Formulation — Assembly of Two Products with a Make-or-Buy Raw Material
  6. Question 6: LP Sensitivity Analysis from a Given Final Simplex Tableau
  7. Question 7: Steady-State Markov Chain — Textbook Buy-Back Cycle
  8. Question 8: CPM — Floats, LP/Network-Flow Formulations, and Crashing
  9. Question 9: Integer Programming Formulation — Cassette Side Arrangement

December 2018

  1. Question 1: Tractor Inventory — EOQ and Dynamic-Demand Lot Sizing
  2. Question 2: Multi-Month Production Planning — LP Formulation Only
  3. Question 3: Graphical LP and its Dual
  4. Question 4: LP Sensitivity Analysis from a Given Final Simplex Tableau
  5. Question 5: Finite-Source Queueing — Machine Repair Model
  6. Question 6: Bayesian Decision Analysis — Credit-Extension Decision
  7. Question 7: Monte Carlo Simulation — Hourly Purchase Volume
  8. Question 8: Newsvendor Model — Weekly Sausage Batch Size
  9. Question 9: Machine-Job Assignment with Setup Times — IP Formulation Only
  10. Question 10: Integer LP — Branch and Bound

December 2017

  1. Question 1: EOQ — Special-Storage Inventory Item
  2. Question 2: LP Formulation — Survey Company Bid
  3. Question 3: Tractor Inventory — EOQ and Dynamic-Programming Lot Sizing
  4. Question 4: Newsvendor Model — Christmas Tree Purchasing
  5. Question 5: Queueing — Should the Jewellery Store Add a Second Parking Spot?
  6. Question 6: LP Sensitivity Analysis from a Given Optimal Tableau
  7. Question 7: Integer-Programming Formulation — Automotive Plant Assignment
  8. Question 8: Steady-State Markov Chain — Textbook Buy-Back Cycle
  9. Question 9: Decision Analysis with Sample Information — The Don Harnett Story

May 2017

  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

December 2016

  1. Question 1: Newsvendor Model — Christmas Tree Order Quantity
  2. Question 2: Dynamic Programming — Sales-Staff Allocation
  3. Question 3: Decision Analysis — Pipeline Weld Inspection
  4. Question 4: LP Formulation — Corn Buy/Sell/Storage Plan
  5. Question 5: LP Sensitivity Analysis from a Given Final Simplex Tableau
  6. Question 6: Markov Chain — Long-Term Expected Generator Output
  7. Question 7: CPM — Floats, LP/Network-Flow Formulations, and Crashing
  8. Question 8: Integer Programming — Power-Plant Expansion Plan

May 2016

  1. Question 1: LP Model for Maximizing NPV of Two Investments
  2. Question 2: Two Iterations of the Revised Simplex Method
  3. Question 3: Labelled Network Flow Model for Hydro-Electric Generation
  4. Question 4: Integer Programming Model for the Cutting-Stock Problem
  5. Question 5: Decision Tree for a Medical/Travel Decision
  6. Question 6: Tolerable Arrival Rate for an M/M/1 Landing Queue
  7. Question 7: Dynamic Programming — Patrol Car Allocation
  8. Question 8: Dynamic Programming Recursion for an Expected Asset Position

December 2014

  1. Question 1: Economic Order Quantity — With and Without Planned Shortages
  2. Question 2: Finite-Source Queueing — Crane Servicing Ten Machines
  3. Question 3: CPM Network and Crashing — Nine-Task Project
  4. Question 4: LP Formulation — Multi-Period Production Planning with Storage
  5. Question 5: Integer LP by Branch and Bound
  6. Question 6: Integer Programming Formulation — Power-Plant Site Selection and Timing
  7. Question 7: Simplex Sensitivity Analysis From a Final Tableau
  8. Question 8: Tractor Inventory — Single-Period EOQ and Dynamic-Programming Lot Sizing
  9. Question 9: Markov Chain Brand Switching — Steady State and Price-Reduction Optimization
  10. Question 10: Monte Carlo Simulation — Machine Breakdown Repair Work

December 2013

  1. Question 1: LP Formulation — Post Office Full-Time / Part-Time Staff Scheduling
  2. Question 2: Simplex Method and Coupled Coefficient/RHS Sensitivity
  3. Question 3: Minimum-Cost Network Flow — Discount Airline Ticket Pairing
  4. Question 4: Fixed-Charge Model — Bookshelf Length Minimization
  5. Question 5: Integer Programming — AGV Round-Trip Routing
  6. Question 6: Decision Analysis — Machine-Screening Policy Under an Unstated Prior
  7. Question 7: Dynamic Programming — Single-Machine Job Sequencing
  8. Question 8: Expected Value of Sample Information — The Coin-Toss Bet
  9. Question 9: Non-Linear Inventory Model with Planned Backorders
  10. Question 10: Queueing Theory — Finite-Capacity Port (M/M/1/K)

May 2013

  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

Undated paper

  1. Question 1: EOQ — Special-Storage Inventory Item
  2. Question 2: LP Formulation — Survey-Company Interview Bid
  3. Question 3: Graphical LP Solution
  4. Question 4: Simplex Sensitivity Analysis from a Given Final Tableau
  5. Question 5: Dynamic Programming — Sales-Staff Assignment
  6. Question 6: Finite-Source Queueing — Overhead Crane Servicing Ten Machines
  7. Question 7: Decision Analysis — Oil Pipeline Weld Inspection
  8. Question 8: Monte Carlo Simulation — Machine Repair Workload
  9. Question 9: Two-Month Markov Decision Process — Advertising Policy
  10. Question 10: CPM Project Network and Crashing LP Formulation