Sect. 13.2.4.1: random ordering, and
ProvedSupplyChainTheory.batch_random_orderingbullwhip-effectoperations-researchprobabilitysupply-chain
retailers face i.i.d. period demands and each orders every periods the demand of the previous periods, on a day chosen uniformly at random from the days of the interval. The number of retailers ordering on a given day is then binomial with parameters and , and the total order received by the supplier satisfies
The book conditions on : given , the order is a sum of i.i.d. demands, so and , and the variance decomposition gives the result. If the variances coincide, as they should.
Formalization Note The binomial law of enters as a hypothesis on the probabilities
, and is supplierOrder, the sum over retailers of their
demands.
Preamble
import Definitions.Def_SupplyChainTheory_bullwhip
Formal statement
namespace SupplyChainTheory
theorem batch_random_ordering {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω}
[MeasureTheory.IsProbabilityMeasure P] {N R : ℕ} {mu sigma : ℝ} (hR : 0 < R)
(B : BatchOrders P N R mu sigma)
(hX : ∀ j : ℕ, P.real {ω | B.X ω = j}
= (Nat.choose N j : ℝ) * (1 / R) ^ j * (1 - 1 / R) ^ (N - j)) :
(∫ ω, B.supplierOrder ω ∂P) = N * mu
∧ ProbabilityTheory.variance B.supplierOrder P
= N * sigma ^ 2 + mu ^ 2 * N * (R - 1) := by sorry
end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, p. 549, Sect. 13.2.4.1 'Random Ordering'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.