Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, pp. 174–175 — continuation and ordering costs are convex and continuous

Proved
TopkisRation.Myopic.C_convex_continuous

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

convexitydynamic-programminginventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Under the standing assumptions of the multiperiod model, every continuation value CmC_mCm​, for 1≤m≤N+11\le m\le N+11≤m≤N+1, is convex and continuous as a real function of net stock. In each actual ordering period, 1≤m≤N1\le m\le N1≤m≤N, the pre-order cost g~,m\widetilde g^{,m}g​,m is convex and continuous on nonnegative order-up-to levels:

Cm is convex and continuous on R,g~,m is convex and continuous on [0,∞).C_m\text{ is convex and continuous on }\mathbb R,\qquad \widetilde g^{,m}\text{ is convex and continuous on }[0,\infty).Cm​ is convex and continuous on R,g​,m is convex and continuous on [0,∞).

This regularity makes the ordering minimization in equation (19) meaningful and supports the critical-level policy.

Formalization Note The page also recalls the §1 characterization of optimal rationing. That separate result is Theorem 1 of this paper and is outside this statement.

Preamble
import Definitions.Def_TopkisRation_Myopic_MultiPeriod
Formal statement
namespace TopkisRation.Myopic

variable {n : ℕ}

/-- The General Case, pp. 174–175: the continuation and ordering cost functions are convex and continuous. -/
theorem C_convex_continuous (Q : MultiModel n) (hQ : Q.Standing) :
    (∀ m ∈ Finset.Icc 1 (Q.N + 1),
      ConvexOn ℝ Set.univ (Q.C m) ∧ Continuous (Q.C m)) ∧
    (∀ m ∈ Finset.Icc 1 Q.N,
      ConvexOn ℝ (Set.Ici 0) (Q.gtilde m) ∧ ContinuousOn (Q.gtilde m) (Set.Ici 0)) := 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. 174–175, §3, The General Case, paragraph after (19)
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