Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4, p. 175 — nondecreasing myopic levels give optimal ordering and rationing

Proved
TopkisRation.Myopic.theorem_4

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

critical-levelinventorymyopic-policyorderingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rationing

Consider ordering periods m,…,Nm,\ldots,Nm,…,N under the paper's standing assumptions. Let v=cN+1v=c_{N+1}v=cN+1​, and choose for each period a myopic level yˉi\bar y_iyˉ​i​ according to the rule that it is any nonnegative minimum of gig^igi, or +∞+\infty+∞ when no minimum exists. If

yˉm≤yˉm+1≤⋯≤yˉN,\bar y_m\le\bar y_{m+1}\le\cdots\le\bar y_N,yˉ​m​≤yˉ​m+1​≤⋯≤yˉ​N​,

then (a) yˉm\bar y_myˉ​m​ is finite and, from any net stock www, ordering to w∨yˉmw\vee\bar y_mw∨yˉ​m​ is optimal among all levels at least w+w^+w+. If m<Nm<Nm<N and the stock at the beginning of period mmm is at most yˉm+1\bar y_{m+1}yˉ​m+1​, then (b) the optimal rationing decisions in every interval of that period are exactly the optimal decisions for the single-period model with terminal costs v1≡0v_1\equiv0v1​≡0 and v2(y)=−cm+1yv_2(y)=-c_{m+1}yv2​(y)=−cm+1​y.

The result identifies when both dynamic ordering and rationing can be computed from single-period cost functions.

Formalization Note Part (b) compares the sets of minimizers of recursion (1) at every interval and every feasible state whose stock does not exceed yˉm+1\bar y_{m+1}yˉ​m+1​. Stock does not rise within a period. The condition yˉm+1<∞\bar y_{m+1}<\inftyyˉ​m+1​<∞ follows from the theorem's hypotheses; the statement expresses (b) for every real value equal to that level.

Preamble
import Definitions.Def_TopkisRation_Myopic_MultiPeriod
Formal statement
namespace TopkisRation.Myopic

variable {n : ℕ}

/-- Theorem 4, p. 175: monotone myopic levels give optimal ordering and, under the stock bound, rationing. -/
theorem theorem_4 (Q : MultiModel n) (hQ : Q.Standing)
    (hv : Q.v = Q.c (Q.N + 1))
    (ybar : ℕ → WithTop ℝ)
    (hy : ∀ i ∈ Finset.Icc 1 Q.N, IsMyopicLevel (Q.gmyopic i) (ybar i))
    (m : ℕ) (hm : m ∈ Finset.Icc 1 Q.N)
    (hmono : MonotoneOn ybar (Set.Icc m Q.N)) :
    (∃ y : ℝ, ybar m = y ∧
      ∀ w z : ℝ, max w 0 ≤ z → Q.gtilde m (max w y) ≤ Q.gtilde m z) ∧
    (m < Q.N → ∀ y' : ℝ, ybar (m + 1) = y' →
      ∀ t ∈ Finset.Icc 1 (Q.P m).k, ∀ z : ℝ, 0 ≤ z → z ≤ y' →
      ∀ B : Fin n → ℝ, 0 ≤ B → ∀ u ∈ TopkisRation.Levels.feasible z B,
      let Ma := (Q.P m).withSalvage (fun _ => 0)
        (fun y => -Q.c (m + 1) * y + Q.C (m + 1) y)
      let Ml := (Q.P m).withSalvage (fun _ => 0)
        (fun y => -Q.c (m + 1) * y)
      IsMinOn (Ma.obj t (Ma.g (t - 1)) z B) (TopkisRation.Levels.feasible z B) u ↔
        IsMinOn (Ml.obj t (Ml.g (t - 1)) z B) (TopkisRation.Levels.feasible z B) u) := 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, Theorem 4
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