Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (5.67): the reorder point is cost-optimal exactly when its fill rate is b1/(h+b1)b_1/(h+b_1)b1​/(h+b1​)

Proved
InventoryControl.rq_optimal_reorder_point

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

inventory-controloperations-researchoptimizationreorder-pointservice-level

The relationship between backorder costs and service levels that Axsäter calls "even more striking" than its discrete counterpart. A continuous review (R,Q)(R,Q)(R,Q) policy has a given batch quantity Q>0Q > 0Q>0; lead-time demand is normal with mean μ′\mu'μ′ and standard deviation σ′>0\sigma' > 0σ′>0; holding costs h>0h > 0h>0 per unit and time unit and backorder costs b1>0b_1 > 0b1​>0 per unit and time unit are charged on the steady-state inventory level, giving the expected cost rate

C(R)  =  E[h (IL)++b1 (IL)−],C(R) \;=\; \mathbb{E}\big[h\,(IL)^{+} + b_1\,(IL)^{-}\big],C(R)=E[h(IL)++b1​(IL)−],

and S2(R)=S3(R)=Pr⁡[IL>0]S_2(R) = S_3(R) = \Pr[IL > 0]S2​(R)=S3​(R)=Pr[IL>0] is the fill rate, equal to the ready rate for continuous demand. The claim is that a reorder point RRR minimizes CCC over all real reorder points if and only if

S2(R)  =  S3(R)  =  b1h+b1.S_2(R) \;=\; S_3(R) \;=\; \frac{b_1}{h + b_1} .S2​(R)=S3​(R)=h+b1​b1​​.

Given a backorder cost, the equation says which service level to plan for; read the other way (Eq. 5.68, b1=hS2/(1−S2)b_1 = h S_2/(1 - S_2)b1​=hS2​/(1−S2​)), a chosen fill rate reveals the backorder cost it implicitly assumes. The book stresses that the equivalence holds only when QQQ is given and the optimization concerns RRR alone; with ordering costs and a joint optimization of RRR and QQQ it fails, which is the subject of Chapter 6.

Formalization Note Optimality is stated as C(R)≤C(R′)C(R) \le C(R')C(R)≤C(R′) for every real R′R'R′, with no sign restriction on either reorder point, and the biconditional carries both directions of the book's sentence: the stationary point is the optimum, and the optimum is stationary. Existence and uniqueness of a reorder point with the required fill rate are not asserted here.

Preamble
import Definitions.Def_InventoryControl_rq
Formal statement
namespace InventoryControl

theorem rq_optimal_reorder_point (h b1 R Q m s : ℝ) (hh : 0 < h) (hb : 0 < b1) (hQ : 0 < Q)
    (hs : 0 < s) :
    (∀ R' : ℝ, rqCost h b1 R Q m s ≤ rqCost h b1 R' Q m s)
      ↔ rqReadyRate R Q m s = b1 / (h + b1) := 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.2, Eq. (5.67) and the sentence before it: 'The optimal R is obtained for dC/dR = 0, and in the optimal solution we have S2 = S3 = 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