The reduced position spends a fraction of the time at each point of the band
ProvedInventoryControl.reduced_position_uniformUnder compound Poisson demand whose demand sizes are not all multiples of some integer larger than one, fix a batch quantity , a reorder point and an initial position , and let be the reduction modulo of , where is the total demand by time . Then for every , almost surely,
This is the ergodic form of "the steady state distribution is uniform". The process is the same for every ordering rule, because every policy's position is congruent to modulo , and it is a continuous-time random walk on the residues driven by the demand sizes; the aperiodicity assumption makes that walk irreducible, and the uniform distribution is stationary because the walk is doubly stochastic (the argument of Proposition 5.1, Eq. 5.33-5.34). The long-run time average of any function of is then its average over the band.
import Definitions.Def_InventoryControl_rqPolicy
namespace InventoryControl
theorem reduced_position_uniform {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω}
[MeasureTheory.IsProbabilityMeasure P] (X : CompoundPoissonDemand P) (R : ℤ) (Q : ℕ)
(hQ : 0 < Q) (y0 : ℤ) (j : ℤ) (hj1 : R + 1 ≤ j) (hj2 : j ≤ R + Q) :
∀ᵐ ω ∂P, Filter.Tendsto
(fun T : ℝ => (1 / T) * ∫ t in (0 : ℝ)..T,
(if reduceToBand R Q (y0 - (X.cumDemand (X.count t ω) ω : ℤ)) = j then (1 : ℝ) else 0))
Filter.atTop (nhds (1 / (Q : ℝ))) := by sorry
end InventoryControl
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.