Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (23): cost of batching the selected base-stock policy

Proved
LostSalesRQ.batching_upper_bound

by Ming Hu · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-guaranteeinventorylost-salesoperations-research

Fix μ≥0\mu\ge0μ≥0, a≥0a\ge0a≥0, k≥0k\ge0k≥0, an integer base-stock level j≥1j\ge1j≥1 and a demand environment of rate one, and let Qk=max⁡{1,⌊2k⌋}Q_k=\max\{1,\lfloor\sqrt{2k}\rfloor\}Qk​=max{1,⌊2k​⌋}, bk=(Qk−1)/2+k/Qkb_k=(Q_k-1)/2+k/Q_kbk​=(Qk​−1)/2+k/Qk​. Every policy following the (j−1,Qk)(j-1,Q_k)(j−1,Qk​) rule satisfies

Cμ,a,k(πrQ(j−1,Qk))≤Lj(a)+bk,andbk≤2k.C_{\mu,a,k}(\pi_{\rm rQ}(j-1,Q_k))\le L_j(a)+b_k,\qquad\text{and}\qquad b_k\le\sqrt{2k}.Cμ,a,k​(πrQ​(j−1,Qk​))≤Lj​(a)+bk​,andbk​≤2k​.

The surcharge (Qk−1)/2(Q_k-1)/2(Qk​−1)/2 is the extra inventory from traversing QkQ_kQk​ inventory positions and k/Qkk/Q_kk/Qk​ spreads the setup charge over a lot, the same tradeoff as in the EOQ formula.

Preamble
import Definitions.Def_LostSalesRQ_model
Formal statement
namespace LostSalesRQ

theorem batching_upper_bound (μ a k : ℝ) (hμ : 0 ≤ μ) (ha : 0 ≤ a) (hk : 0 ≤ k)
    (S : DemandSpace 1) (j : ℕ) (hj : 1 ≤ j) (π : Policy S)
    (hπ : IsRQPolicy μ (j - 1) (lotSize k) π) :
    π.avgCost μ 1 a k ≤ ENNReal.ofReal (baseStockCost μ a j + batchSurcharge k) ∧
    batchSurcharge k ≤ Real.sqrt (2 * k) := by sorry

end LostSalesRQ
Source
M. Hu, "A 1.932 Guarantee for (r,Q) Policies in Continuous-Review Lost-Sales Inventory Systems", arXiv:2610.34576, 2026; Section 4.6.1, eq. (23) (p. 21); Appendix J.2 (pp. A22-A24).
Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Ming Hu · Nov 18, 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