Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3.3: the (r,Q)(r,Q)(r,Q) rule defines an admissible policy

Proved
LostSalesRQ.rq_policy_exists

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

approximation-guaranteeinventorylost-salesoperations-research

For every demand rate λ≥0\lambda\ge0λ≥0, lead time L≥0L\ge0L≥0, demand environment of rate λ\lambdaλ, reorder point r∈Nr\in\mathbb Nr∈N and lot size Q≥1Q\ge1Q≥1, there is an admissible policy on that environment that follows the classical (r,Q)(r,Q)(r,Q) rule: it starts with r+Qr+Qr+Q units on hand and an empty pipeline, and a served demand that reduces the inventory position from r+1r+1r+1 to rrr triggers one immediate order of QQQ units, with no other orders.

The paper uses πrQ(r,Q)\pi_{\rm rQ}(r,Q)πrQ​(r,Q) as a policy throughout; this statement records that the rule defines an adapted, right-continuous cumulative order process, so that it belongs to the admissible class over which OPT\mathrm{OPT}OPT is taken.

Formalization Note The rule is the fixed-point condition U(t)=Q⌊A(t)/Q⌋U(t)=Q\lfloor\mathcal A(t)/Q\rfloorU(t)=Q⌊A(t)/Q⌋ together with r+Qr+Qr+Q initial units on hand; the statement asserts that a policy satisfying it exists.

Preamble
import Definitions.Def_LostSalesRQ_model
Formal statement
namespace LostSalesRQ

theorem rq_policy_exists (lam L : ℝ) (hlam : 0 ≤ lam) (hL : 0 ≤ L) (S : DemandSpace lam)
    (r Q : ℕ) (hQ : 1 ≤ Q) :
    ∃ π : Policy S, IsRQPolicy L r Q π := 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.3 and Table 2 (p. 7).
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