Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 175 — ordering to w ∨ x̄ᵐ minimizes period-m cost

Proved
TopkisRation.Myopic.order_up_to

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

critical-levelinventoryorderingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For each ordering period mmm, the convex actual cost g~,m\widetilde g^{,m}g​,m attains a minimum at some xˉm≥0\bar x^m\ge0xˉm≥0. Every nonnegative minimizer xxx yields an optimal order-up-to policy: from net stock www, among all feasible order-up-to levels z≥w+z\ge w^+z≥w+, the level w∨xw\vee xw∨x minimizes g~,m\widetilde g^{,m}g​,m:

g~,m(w∨x)≤g~,m(z)(z≥w+).\widetilde g^{,m}(w\vee x)\le\widetilde g^{,m}(z)\qquad(z\ge w^+).g​,m(w∨x)≤g​,m(z)(z≥w+).

This is the general dynamic ordering policy before the myopic-level condition of Theorem 4 is imposed.

Preamble
import Definitions.Def_TopkisRation_Myopic_MultiPeriod
Formal statement
namespace TopkisRation.Myopic

variable {n : ℕ}

/-- The General Case, p. 175: `g̃ᵐ` has a minimizer, and ordering to its level is optimal. -/
theorem order_up_to (Q : MultiModel n) (hQ : Q.Standing)
    (m : ℕ) (hm : m ∈ Finset.Icc 1 Q.N) :
    (∃ x : ℝ, 0 ≤ x ∧ ∀ z, 0 ≤ z → Q.gtilde m x ≤ Q.gtilde m z) ∧
    ∀ x : ℝ, 0 ≤ x → (∀ z, 0 ≤ z → Q.gtilde m x ≤ Q.gtilde m z) →
      ∀ w z : ℝ, max w 0 ≤ z → Q.gtilde m (max w x) ≤ Q.gtilde m z := by sorry

end TopkisRation.Myopic
Source
Topkis, Optimal ordering and rationing policies in a nonstationary dynamic inventory model with n demand classes, Management Science 15 (1968), p. 175, §3, The General Case, paragraph before Myopic Policies
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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