Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (5.60): C(R+1)−C(R)=−b1+(h+b1) S3(R+1)C(R+1) - C(R) = -b_1 + (h + b_1)\,S_3(R+1)C(R+1)−C(R)=−b1​+(h+b1​)S3​(R+1)

Proved
InventoryControl.rq_discrete_cost_diff

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

inventory-controloperations-researchreorder-pointservice-level

Under a continuous review (R,Q)(R,Q)(R,Q) policy with discrete lead-time demand, batch quantity Q≥1Q \ge 1Q≥1, holding cost hhh and shortage cost b1b_1b1​ per unit and time unit, raising the reorder point by one unit changes the total cost rate by

C(R+1,Q)−C(R,Q)  =  −b1+(h+b1) S3(R+1),C(R+1, Q) - C(R, Q) \;=\; -b_1 + (h + b_1)\,S_3(R+1),C(R+1,Q)−C(R,Q)=−b1​+(h+b1​)S3​(R+1),

where S3(R+1)=Pr⁡[IL>0]S_3(R+1) = \Pr[IL > 0]S3​(R+1)=Pr[IL>0] is the ready rate at reorder point R+1R + 1R+1.

The book obtains this from the cost expression (5.57) and the shift relation (5.37), Pr⁡[IL=j∣R]=Pr⁡[IL=j+1∣R+1]\Pr[IL = j \mid R] = \Pr[IL = j + 1 \mid R + 1]Pr[IL=j∣R]=Pr[IL=j+1∣R+1]. The ordering cost Aμ/QA\mu/QAμ/Q does not depend on RRR and cancels. Since the ready rate increases with RRR, the increments are nondecreasing and the cost is convex in the reorder point, which is what makes the search "increase RRR by one unit at a time until the costs are increasing" exact.

Preamble
import Definitions.Def_InventoryControl_rqDiscrete
Formal statement
namespace InventoryControl

theorem rq_discrete_cost_diff (D : DiscreteDemand) (h b1 A μ : ℝ) (R : ℤ) (Q : ℕ) (hQ : 0 < Q) :
    rqDiscreteCost D h b1 A μ (R + 1) Q - rqDiscreteCost D h b1 A μ R Q
      = -b1 + (h + b1) * rqDiscreteReadyRate D (R + 1) Q := by sorry

end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 85, Sect. 5.9.1, Eq. (5.60)
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