Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (5.61): the largest reorder point with S3(R)≤b1/(h+b1)S_3(R) \le b_1/(h+b_1)S3​(R)≤b1​/(h+b1​) is optimal

Proved
InventoryControl.rq_discrete_optimal_R

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

inventory-controloperations-researchreorder-pointservice-level

The discrete counterpart of the fill-rate rule for the reorder point. Under a continuous review (R,Q)(R,Q)(R,Q) policy with discrete lead-time demand, batch quantity Q≥1Q \ge 1Q≥1, and costs h>0h > 0h>0, b1>0b_1 > 0b1​>0, let R∗R^{*}R∗ be the largest reorder point whose ready rate does not exceed b1/(h+b1)b_1/(h+b_1)b1​/(h+b1​), that is

S3(R∗)  ≤  b1h+b1  <  S3(R∗+1).S_3(R^{*}) \;\le\; \frac{b_1}{h + b_1} \;<\; S_3(R^{*} + 1).S3​(R∗)≤h+b1​b1​​<S3​(R∗+1).

Then R∗R^{*}R∗ minimizes the total cost rate C(⋅,Q)C(\cdot, Q)C(⋅,Q) over all integral reorder points.

The two inequalities say, through Eq. (5.60), that moving from R∗R^{*}R∗ to R∗+1R^{*}+1R∗+1 increases the cost while moving from R∗−1R^{*}-1R∗−1 to R∗R^{*}R∗ does not; with the cost convex in RRR that is optimality. The book notes that for pure Poisson demand the same statement holds with the fill rate in place of the ready rate, since the two coincide.

Formalization Note R∗R^{*}R∗ is given together with the two service-level inequalities that define it as the largest such reorder point; existence of such an R∗R^{*}R∗ (the ready rate increases from 000 to 111) is not part of the claim.

Preamble
import Definitions.Def_InventoryControl_rqDiscrete
Formal statement
namespace InventoryControl

theorem rq_discrete_optimal_R (D : DiscreteDemand) (h b1 A μ : ℝ) (hh : 0 < h) (hb : 0 < b1)
    (Q : ℕ) (hQ : 0 < Q) (Rstar : ℤ)
    (hlo : rqDiscreteReadyRate D Rstar Q ≤ b1 / (h + b1))
    (hhi : b1 / (h + b1) < rqDiscreteReadyRate D (Rstar + 1) Q) :
    ∀ R : ℤ, rqDiscreteCost D h b1 A μ Rstar Q ≤ rqDiscreteCost D h b1 A μ 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. 86, Sect. 5.9.1, Eq. (5.61): 'The optimal reorder point can be characterized as the largest reorder point giving a ready rate not higher than b1/(h + b1)'
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