The policy attains the long-run cost
ProvedInventoryControl.rq_policy_costinventory-controloperations-researchreorder-pointstochastic-processes
The second half of Proposition 6.1. Under compound Poisson demand with the aperiodicity assumption, with orders in batches of , lead-time , lead-time demand law equal to the distribution of the demand over an interval of length , and cost rate with , the policy started from any has long-run average cost exactly : almost surely
where is the position under the policy. This is Eq. (6.4) with the ordering cost set to , and it holds for every reorder point , not only the minimizer of ; combined with the lower bound it gives Proposition 6.1.
Preamble
import Definitions.Def_InventoryControl_rqPolicy
Formal statement
namespace InventoryControl
theorem rq_policy_cost {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω}
[MeasureTheory.IsProbabilityMeasure P] (X : CompoundPoissonDemand P) (D : DiscreteDemand)
(h b1 L : ℝ) (hh : 0 < h) (hb : 0 < b1) (hL : 0 ≤ L)
(hD : ∀ j : ℕ, D.p j = P.real {ω | X.cumDemand (X.count L ω) ω = j})
(Q : ℕ) (hQ : 0 < Q) (R : ℤ) (y0 : ℤ) :
∀ᵐ ω ∂P, Filter.Tendsto (fun T => avgCost X D h b1 L Q y0 (rqOrders X R Q y0) T ω)
Filter.atTop (nhds (windowCost D h b1 Q R / Q)) := by sorry
end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 115, Sect. 6.2.1, proof of Proposition 6.1: 'But this lower bound can be achieved by using an (R, Q) policy. Using an (R, Q) policy the inventory position is also uniform on {R + 1, R + 2, ..., R + Q}. (We obtain the costs by setting A = 0 in Eq. (6.4).)'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.