Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1(c)–(d) — additive demand: gt(y,dt(y))g_t(y,d_t(y))gt​(y,dt​(y)) and vtv_tvt​ are kkk-concave, and an (s,S,p)(s,S,p)(s,S,p) policy is optimal

Proved
ChenSimchiLevi.Additive.theorem_3_1

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

dynamic-programminginventoryk-convexityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1pricing

Consider the finite-horizon joint pricing and inventory model of Chen and Simchi-Levi (2004) with fixed ordering cost kkk, under Assumptions 1–5 (with cT+1=0c_{T+1} = 0cT+1​=0, ct≥0c_t \ge 0ct​≥0, k≥0k \ge 0k≥0) and additive demand wt=Dt(pt)+βtw_t = D_t(p_t) + \beta_twt​=Dt​(pt​)+βt​. Let vtv_tvt​ be the profit-to-go (2) and gtg_tgt​ the one-period objective (3). Then for every period t=T,T−1,…,1t = T, T-1, \dots, 1t=T,T−1,…,1:

(c) For every yyy, gt(y,⋅)g_t(y, \cdot)gt​(y,⋅) attains its maximum over [d‾t,dˉt][\underline d_t, \bar d_t][d​t​,dˉt​] at some dt(y)d_t(y)dt​(y), and both

y↦gt(y,dt(y))andx↦vt(x)y \mapsto g_t\big(y, d_t(y)\big) \qquad\text{and}\qquad x \mapsto v_t(x)y↦gt​(y,dt​(y))andx↦vt​(x)

are kkk-concave.

(d) There exist st≤Sts_t \le S_tst​≤St​ such that the following policy is optimal in period ttt: if the initial inventory satisfies xt<stx_t < s_txt​<st​, order up to StS_tSt​ and set the expected demand to dt(St)d_t(S_t)dt​(St​); otherwise order nothing and set the expected demand to dt(xt)d_t(x_t)dt​(xt​). Precisely, writing y∗(x)=Sty^*(x) = S_ty∗(x)=St​ if x<stx < s_tx<st​ and y∗(x)=xy^*(x) = xy∗(x)=x otherwise, for every xxx:

  1. y∗(x)≥xy^*(x) \ge xy∗(x)≥x and y∗(x)y^*(x)y∗(x) maximizes −k δ(y−x)+gt(y,dt(y))-k\,\delta(y - x) + g_t(y, d_t(y))−kδ(y−x)+gt​(y,dt​(y)) over y≥xy \ge xy≥x;
  2. vt(x)=ctx−k δ(y∗(x)−x)+gt(y∗(x),dt(y∗(x)))v_t(x) = c_t x - k\,\delta(y^*(x) - x) + g_t\big(y^*(x), d_t(y^*(x))\big)vt​(x)=ct​x−kδ(y∗(x)−x)+gt​(y∗(x),dt​(y∗(x)));
  3. some expected demand d∈[d‾t,dˉt]d \in [\underline d_t, \bar d_t]d∈[d​t​,dˉt​] maximizes gt(y∗(x),⋅)g_t(y^*(x), \cdot)gt​(y∗(x),⋅); the corresponding price is p=Dt−1(d)p = D_t^{-1}(d)p=Dt−1​(d).

This is the paper's main result: with additive demand, the (s,S,p)(s, S, p)(s,S,p) policy conjectured by Thomas (1974) is optimal, and the price depends on the inventory level after ordering.

Formalization Note. kkk-concavity of fff is the platform's BertsekasKConvex k (−f) (Definition 2.1). The values gt(y,dt(y))g_t(y, d_t(y))gt​(y,dt​(y)) and vt(x)v_t(x)vt​(x) are defined as suprema (real sSup); the attainment statements in (c) and (d) show that these suprema are maxima. The model is in expected-demand space; the price is Pt(d)=Dt−1(d)P_t(d) = D_t^{-1}(d)Pt​(d)=Dt−1​(d). The hypotheses cT+1=0c_{T+1} = 0cT+1​=0, ct≥0c_t \ge 0ct​≥0 and k≥0k \ge 0k≥0 are added to the paper's Assumptions 1–5 (see the model definition).

Preamble
import Mathlib
import Definitions.Def_BertsekasKConvex
import Definitions.Def_ChenSimchiLevi_Additive_Model
Formal statement
namespace ChenSimchiLevi.Additive

/-- Theorem 3.1(c)–(d) of Chen–Simchi-Levi (2004), p. 890: under additive demand, for every period
`t = T, …, 1`,
(c) `g_t(·, d)` attains its maximum over `[d_t, d̄_t]` at every `y`, and `g_t(y, d_t(y))` and
`v_t(x)` are `k`-concave;
(d) there are `s_t ≤ S_t` such that the `(s, S)` order — order up to `S_t` if `x < s_t`, otherwise
do not order — attains the maximum in (2), `v_t(x)` equals `c_t x` plus that maximum, and the
expected demand is set to a maximizer of `g_t(y, ·)` at the post-order level `y`. -/
theorem theorem_3_1 (M : Model) (hA : M.Assumptions) (hadd : M.IsAdditive) :
    ∀ t ∈ Finset.Icc 1 M.T,
      ((∀ y : ℝ, ∃ d ∈ Set.Icc (M.dlo t) (M.dhi t),
          IsMaxOn (M.g t y) (Set.Icc (M.dlo t) (M.dhi t)) d) ∧
        BertsekasKConvex M.k (fun y => -M.Gstar t y) ∧
        BertsekasKConvex M.k (fun x => -M.v t x)) ∧
      (∃ s S : ℝ, s ≤ S ∧ ∀ x : ℝ,
        x ≤ sSOrder s S x ∧
        (∀ y : ℝ, x ≤ y → M.orderObj t x y ≤ M.orderObj t x (sSOrder s S x)) ∧
        M.v t x = M.c t * x + M.orderObj t x (sSOrder s S x) ∧
        ∃ d ∈ Set.Icc (M.dlo t) (M.dhi t),
          IsMaxOn (M.g t (sSOrder s S x)) (Set.Icc (M.dlo t) (M.dhi t)) d) := by sorry

end ChenSimchiLevi.Additive
Source
Chen, Simchi-Levi, Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Finite Horizon Case, Operations Research 52(6) (2004), p. 890, Theorem 3.1(c)–(d)
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