Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6.1: an (R,Q)(R,Q)(R,Q) policy is optimal when ordering in batches

Proved
InventoryControl.rq_policy_optimal

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

inventory-controloperations-researchoptimal-controlreorder-pointstochastic-processes

Proposition 6.1 of Axsäter, Inventory Control: an (R,Q)(R,Q)(R,Q) policy is optimal.

The setting is Sect. 6.2.1. Demand is compound Poisson: customers arrive at rate λ\lambdaλ and each demands an integral number of units, i.i.d., not all demands being multiples of some integer larger than one. The lead-time LLL is constant, and D(L)D(L)D(L), the demand over a lead-time, has the law DDD. A holding cost h>0h > 0h>0 and a shortage cost b1>0b_1 > 0b1​>0 per unit and time unit are charged; there are no ordering costs, but all orders must be multiples of a given batch quantity Q≥1Q \ge 1Q≥1 and can only be triggered by customer demands. For an inventory position kkk the expected holding-plus-shortage cost rate a lead-time later is g(k)=−b1(k−μ′)+(h+b1)∑j=1kjPr⁡[D(L)=k−j]g(k) = -b_1(k - \mu') + (h+b_1)\sum_{j=1}^{k} j\Pr[D(L) = k-j]g(k)=−b1​(k−μ′)+(h+b1​)∑j=1k​jPr[D(L)=k−j], so the cost rate at time t+Lt + Lt+L is g(yt)g(y_t)g(yt​), where yty_tyt​ is the position at time ttt. Let gˉ(y)=∑j=1Qg(y+j)\bar g(y) = \sum_{j=1}^{Q} g(y + j)gˉ​(y)=∑j=1Q​g(y+j) and let RRR be an integer minimizing gˉ\bar ggˉ​.

The claim has two parts, both almost sure:

  1. for every ordering rule mmm and every initial position y0y_0y0​,
lim inf⁡T→∞1T∫0Tg(yt−Lm) dt  ≥  gˉ(R)Q;\liminf_{T\to\infty} \frac{1}{T}\int_0^T g\big(y^{m}_{t-L}\big)\,\mathrm{d}t \;\ge\; \frac{\bar g(R)}{Q};T→∞liminf​T1​∫0T​g(yt−Lm​)dt≥Qgˉ​(R)​;
  1. the (R,Q)(R,Q)(R,Q) policy with this RRR attains it:
1T∫0Tg(yt−L(R,Q)) dt  ⟶  gˉ(R)Q.\frac{1}{T}\int_0^T g\big(y^{(R,Q)}_{t-L}\big)\,\mathrm{d}t \;\longrightarrow\; \frac{\bar g(R)}{Q}.T1​∫0T​g(yt−L(R,Q)​)dt⟶Qgˉ​(R)​.

Together: no policy that orders in batches of QQQ can do better in the long run than the (R,Q)(R,Q)(R,Q) policy whose reorder point minimizes gˉ\bar ggˉ​. The book notes that for Q=1Q = 1Q=1 this is the optimality of an SSS policy when there are no ordering costs, and that for continuous or Poisson demand it also gives the optimality of (s,S)(s,S)(s,S) policies, which coincide with (R,Q)(R,Q)(R,Q) policies there.

Formalization Note A policy is any function assigning to each demand epoch and outcome a number of batches; no measurability is required, since the lower bound is pathwise. The average is over [0,T][0, T][0,T] with the cost rate ggg evaluated at the position a lead-time earlier, the position being y0y_0y0​ before time 000; "lim inf⁡≥c\liminf \ge climinf≥c" is stated as "for every ε>0\varepsilon > 0ε>0, eventually ≥c−ε\ge c - \varepsilon≥c−ε". The initial position is arbitrary, as in the book, and the reorder point is any minimizer of gˉ\bar ggˉ​, whose existence follows from g(k)→∞g(k) \to \inftyg(k)→∞ as ∣k∣→∞|k| \to \infty∣k∣→∞ (a theorem of the previous mission).

Preamble
import Definitions.Def_InventoryControl_rqPolicy
Formal statement
namespace InventoryControl

theorem rq_policy_optimal {Ω : 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 : ℤ)
    (hR : ∀ y : ℤ, windowCost D h b1 Q R ≤ windowCost D h b1 Q y) (y0 : ℤ) :
    (∀ m : ℕ → Ω → ℕ, ∀ᵐ ω ∂P, ∀ ε : ℝ, 0 < ε →
        ∀ᶠ T in Filter.atTop, windowCost D h b1 Q R / Q - ε ≤ avgCost X D h b1 L Q y0 m T ω)
      ∧ (∀ᵐ ω ∂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, pp. 113-115, Sect. 6.2.1 'Optimality of (R, Q) Policies When Ordering in Batches', Proposition 6.1 and its proof; after Chen (2000)
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