NivaarExam PrepOfficial exam papers ↗

23-Ind-A1 Operations Research · December 2018

Question 7 of 10: Monte Carlo Simulation — Hourly Purchase Volume

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

Notes on this paper

National Exams — December 2018 — 17-Ind-A1 Operations Research. Three-hour, open-book exam (any non-communicating calculator permitted); the paper totals 170 marks across 10 questions and only 100 marks are required, so a candidate would normally answer a subset — all ten are solved below for completeness.

Reference texts: Hillier & Lieberman, Introduction to Operations Research (11th ed., McGraw-Hill) — linear programming, the simplex method & sensitivity analysis/duality (ch. 3–4/6), integer programming & branch and bound (ch. 12), queueing theory (ch. 17), decision analysis (ch. 15), computer simulation (ch. 20). Nahmias, Production and Operations Analysis — single-period (newsvendor) and multi-period (dynamic lot-sizing / Wagner–Whitin) inventory models.

Question 7: Monte Carlo Simulation — Hourly Purchase Volume (20 marks)

Question text not reproduced: the examination questions are © Engineers and Geoscientists BC. Open the official past paper (linked at the top of this page) to read the question, then follow the worked solution below.

Given. Arrivals/hr: $P(0)=0.5,\ P(1)=0.3,\ P(2)=0.2$. Purchase prob. per arrival $=0.7$. Purchase value: $\$10$ (0.2), $\$100$ (0.6), $\$1000$ (0.2). 12 four-digit random numbers.

Find. A random-number assignment scheme (flow chart), one simulated hour's number of purchases and dollar volume, applying the given random numbers in order.

Approach. Split each 4-digit random number into two 2-digit numbers (00–99); assign cumulative-probability ranges to each of the three random experiments (arrivals, purchase decision, purchase value) and consume the random-number stream left to right, one draw per experiment needed.

Start (new hour) Draw RN → number of arrivals (0 / 1 / 2) For each arrival: draw RN → purchase? (Y/N) If Y: draw RN → purchase value ($10/$100/$1000) Tally purchase count and dollar total Output: purchases/hr, $ volume/hr
Simulation flow chart: one random draw per arrival-count decision, per purchase Yes/No decision, and per purchase value.
  1. Assign 2-digit random-number ranges by cumulative probability (00–99):
    Random-number assignment table
    ExperimentOutcomeProb.CumulativeRN range
    Arrivals00.500.5000–49
    10.300.8050–79
    20.201.0080–99
    Purchase?Yes0.700.7000–69
    No0.301.0070–99
    Value$100.200.2000–19
    $1000.600.8020–79
    $10000.201.0080–99
  2. Consume the random-number stream left to right, splitting each 4-digit number into two 2-digit halves ($9508\to95,08$; $3702\to37,02$; $9250\to92,50$; …):
    Simulation walk-through
    StepRN usedDraw forResult
    195Arrivals95∈80–99 → 2 arrivals
    208Arrival 1: purchase?08∈00–69 → Yes
    337Arrival 1: value37∈20–79 → $100
    402Arrival 2: purchase?02∈00–69 → Yes
    592Arrival 2: value92∈80–99 → $1000
    Both arrivals purchase, so this simulated hour has $2$ purchases totalling $\$100+\$1000=\$1{,}100$. $$\boxed{\text{Simulated purchases/hr}=2,\quad \text{Simulated dollar volume}=\$1{,}100}$$
  3. Theoretical benchmark (for context, not required by the question). Expected arrivals $=0(0.5)+1(0.3)+2(0.2)=0.7$; expected purchases/hr $=0.7(0.7)=0.49$; expected value per purchase $=10(0.2)+100(0.6)+1000(0.2)=\$262$; expected dollar volume/hr $=0.49(262)=\$128.38$. A single simulated hour (2 purchases, $1,100) is well above this long-run average, which is expected sampling variability, not an error — more replications would be needed to estimate the average reliably.
Final results — Question 7
ItemValue
Simulated arrivals2
Simulated purchases2
Simulated dollar volume$1,100
Theoretical mean purchases/hr0.49 (context)
Theoretical mean dollar volume/hr$128.38 (context)