Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The (R,Q)(R,Q)(R,Q) policy attains the long-run cost gˉ(R)/Q\bar g(R)/Qgˉ​(R)/Q

Proved
InventoryControl.rq_policy_cost

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

inventory-controloperations-researchreorder-pointstochastic-processes

The second half of Proposition 6.1. Under compound Poisson demand with the aperiodicity assumption, with orders in batches of Q≥1Q \ge 1Q≥1, lead-time L≥0L \ge 0L≥0, lead-time demand law DDD equal to the distribution of the demand over an interval of length LLL, and cost rate ggg with h,b1>0h, b_1 > 0h,b1​>0, the (R,Q)(R,Q)(R,Q) policy started from any y0y_0y0​ has long-run average cost exactly gˉ(R)/Q\bar g(R)/Qgˉ​(R)/Q: almost surely

1T∫0Tg(yt−L) dt  ⟶  1Q∑j=1Qg(R+j)(T→∞),\frac{1}{T}\int_0^T g\big(y_{t-L}\big)\,\mathrm{d}t \;\longrightarrow\; \frac{1}{Q}\sum_{j=1}^{Q} g(R+j) \qquad (T \to \infty),T1​∫0T​g(yt−L​)dt⟶Q1​j=1∑Q​g(R+j)(T→∞),

where yty_tyt​ is the position under the (R,Q)(R,Q)(R,Q) policy. This is Eq. (6.4) with the ordering cost AAA set to 000, and it holds for every reorder point RRR, not only the minimizer of gˉ\bar ggˉ​; 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
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me