Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The (R,Q)(R,Q)(R,Q) cost is convex in the reorder point

Proved
InventoryControl.rq_discrete_cost_convex_R

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

discrete-optimizationinventory-controloperations-researchreorder-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, the total cost rate is a convex function of the integral reorder point: for every R∈ZR \in \mathbb{Z}R∈Z,

C(R+1,Q)−C(R,Q)  ≤  C(R+2,Q)−C(R+1,Q).C(R+1, Q) - C(R, Q) \;\le\; C(R+2, Q) - C(R+1, Q).C(R+1,Q)−C(R,Q)≤C(R+2,Q)−C(R+1,Q).

The increments are −b1+(h+b1)S3(R+1)-b_1 + (h+b_1)S_3(R+1)−b1​+(h+b1​)S3​(R+1) by Eq. (5.60), and the ready rate S3S_3S3​ is nondecreasing in RRR because each of its terms Pr⁡[D(L)≤k−1]\Pr[D(L) \le k - 1]Pr[D(L)≤k−1] is. Convexity is what lets the optimal reorder point for a given QQQ be characterized by a single comparison of service levels, Eq. (5.61).

Preamble
import Definitions.Def_InventoryControl_rqDiscrete
Formal statement
namespace InventoryControl

theorem rq_discrete_cost_convex_R (D : DiscreteDemand) (h b1 A μ : ℝ) (hh : 0 < h) (hb : 0 < b1)
    (Q : ℕ) (hQ : 0 < Q) (R : ℤ) :
    rqDiscreteCost D h b1 A μ (R + 1) Q - rqDiscreteCost D h b1 A μ R Q
      ≤ rqDiscreteCost D h b1 A μ (R + 2) Q - rqDiscreteCost D h b1 A μ (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. 86, Sect. 5.9.1: 'Because the ready rate increases with the reorder point, it follows that C(R + 1) - C(R) is increasing with R, i.e., the cost is convex in the reorder point'
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