Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.4: exact zero-setup costs of the base-stock policies

Proved
LostSalesRQ.exact_base_stock_cost

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

approximation-guaranteeinventorylost-salesoperations-research

Fix normalized lead-time demand μ≥0\mu\ge0μ≥0, penalty a≥0a\ge0a≥0 (unit demand rate, unit holding cost, no setup cost) and any demand environment of rate one. The empty no-order policy has average cost aaa, and for every integer level j≥1j\ge1j≥1 every policy following the base-stock rule (r=j−1r=j-1r=j−1, Q=1Q=1Q=1) has average cost

Cμ,a,0(πS(j))=Lj(a)=Hj+a ej=j−μ+(μ+a) ej.C_{\mu,a,0}(\pi_{\rm S}(j))=L_j(a)=H_j+a\,e_j=j-\mu+(\mu+a)\,e_j .Cμ,a,0​(πS​(j))=Lj​(a)=Hj​+aej​=j−μ+(μ+a)ej​.

Pending replacements form an M/D/j/jM/D/j/jM/D/j/j loss system, whose occupied-position count is Poisson(μ)(\mu)(μ) conditioned to be at most jjj; eje_jej​ is the long-run fraction of demand lost and HjH_jHj​ the mean on-hand inventory. These closed forms are what the selection algorithm minimizes.

Formalization Note The average cost is the upper limit of expected average costs from the stated initialization (jjj units on hand, empty pipeline), not a stationary expectation; the statement asserts that it equals the Erlang formula.

Preamble
import Definitions.Def_LostSalesRQ_model
Formal statement
namespace LostSalesRQ

theorem exact_base_stock_cost (μ a : ℝ) (hμ : 0 ≤ μ) (ha : 0 ≤ a) (S : DemandSpace 1) :
    (noOrderPolicy S).avgCost μ 1 a 0 = ENNReal.ofReal a ∧
    ∀ j : ℕ, 1 ≤ j → ∀ π : Policy S, IsRQPolicy μ (j - 1) 1 π →
      π.avgCost μ 1 a 0 = ENNReal.ofReal (baseStockCost μ a j) := 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 3.4, eq. (4) (p. 8); Section 3.2 (p. 6); Appendix A (p. A1).
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