Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (20), pp. 175–176 — actual and myopic costs agree below the next level

Proved
TopkisRation.Myopic.eq_20

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

dynamic-programminginventorymyopic-policyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For 2≤m≤N2\le m\le N2≤m≤N, let x≥0x\ge0x≥0 minimize the actual period-mmm cost g~,m\widetilde g^{,m}g​,m. Then for a nonnegative stock level z≤xz\le xz≤x, the actual and myopic costs in period m−1m-1m−1 differ by the constant Cm(x)C_m(x)Cm​(x); for z≥xz\ge xz≥x, the actual cost is at least the myopic cost plus that constant:

g~,m−1(z)=gm−1(z)+Cm(x)(0≤z≤x),g~,m−1(z)≥gm−1(z)+Cm(x)(z≥x).\widetilde g^{,m-1}(z)=g^{m-1}(z)+C_m(x)\quad(0\le z\le x),\qquad \widetilde g^{,m-1}(z)\ge g^{m-1}(z)+C_m(x)\quad(z\ge x).g​,m−1(z)=gm−1(z)+Cm​(x)(0≤z≤x),g​,m−1(z)≥gm−1(z)+Cm​(x)(z≥x).

Equation (20) is the comparison that transfers a myopic minimum to an optimal dynamic order-up-to level.

Formalization Note The paper writes x=yˉmx=\bar y_mx=yˉ​m​ in the induction, when it has already established that yˉm\bar y_myˉ​m​ minimizes g~,m\widetilde g^{,m}g​,m.

Preamble
import Definitions.Def_TopkisRation_Myopic_MultiPeriod
Formal statement
namespace TopkisRation.Myopic

variable {n : ℕ}

/-- Equation (20), pp. 175–176: comparison of actual and myopic period costs. -/
theorem eq_20 (Q : MultiModel n) (hQ : Q.Standing)
    (m : ℕ) (hm2 : 2 ≤ m) (hmN : m ≤ Q.N)
    (x : ℝ) (hx : 0 ≤ x)
    (hmin : ∀ z, 0 ≤ z → Q.gtilde m x ≤ Q.gtilde m z) :
    (∀ z, 0 ≤ z → z ≤ x →
      Q.gtilde (m - 1) z = Q.gmyopic (m - 1) z + Q.C m x) ∧
    ∀ z, x ≤ z →
      Q.gmyopic (m - 1) z + Q.C m x ≤ Q.gtilde (m - 1) 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), pp. 175–176, proof of Theorem 4, equation (20)
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