Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sect. 9.2.1, p. 177: the integer ratio is chosen by k∗/k′≤(k′+1)/k∗k^*/k' \le (k'+1)/k^*k∗/k′≤(k′+1)/k∗, and A1/e1≥A2/e2A_1/e_1 \ge A_2/e_2A1​/e1​≥A2​/e2​ gives k=1k = 1k=1

Proved
InventoryControl.two_level_integer_k

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

discrete-optimizationinventory-controllot-sizingmulti-echelonoperations-research

In the two-level serial system with d,A1,A2,e1,e2>0d, A_1, A_2, e_1, e_2 > 0d,A1​,A2​,e1​,e2​>0 and k∗=A2e1/(A1e2)k^{*} = \sqrt{A_2e_1/(A_1e_2)}k∗=A2​e1​/(A1​e2​)​, the comparison between two consecutive positive integer ratios is settled by the same geometric-mean rule as the integer EOQ of Sect. 4.1.2: for every integer k′≥1k' \ge 1k′≥1,

C(k′)≤C(k′+1)⟺k∗k′≤k′+1k∗,C(k') \le C(k'+1) \quad\Longleftrightarrow\quad \frac{k^{*}}{k'} \le \frac{k'+1}{k^{*}},C(k′)≤C(k′+1)⟺k′k∗​≤k∗k′+1​,

and if A1/e1≥A2/e2A_1/e_1 \ge A_2/e_2A1​/e1​≥A2​/e2​, that is k∗≤1k^{*} \le 1k∗≤1, then k=1k = 1k=1 is optimal among all positive integers.

The first statement is what the book means by "it is optimal to choose k=k′k = k'k=k′ if k∗/k′≤(k′+1)/k∗k^{*}/k' \le (k'+1)/k^{*}k∗/k′≤(k′+1)/k∗, otherwise k=k′+1k = k'+1k=k′+1", since C(k)C(k)C(k) is unimodal in kkk. The second says that when the ratio of ordering to holding cost is larger downstream, the two items should share one batch: no stock of item 2 is ever held and the two-stage system collapses to a single stage, a conclusion the book notes also holds for time-varying demand (Axsäter and Nuttle, 1987).

Preamble
import Definitions.Def_InventoryControl_serial
Formal statement
namespace InventoryControl

theorem two_level_integer_k (d A1 A2 e1 e2 : ℝ) (hd : 0 < d) (hA1 : 0 < A1) (hA2 : 0 < A2)
    (he1 : 0 < e1) (he2 : 0 < e2) :
    (∀ k : ℕ, 0 < k →
        (twoLevelOptCost d A1 A2 e1 e2 k ≤ twoLevelOptCost d A1 A2 e1 e2 (k + 1)
          ↔ Real.sqrt (A2 * e1 / (A1 * e2)) / k ≤ (k + 1) / Real.sqrt (A2 * e1 / (A1 * e2))))
      ∧ (A2 / e2 ≤ A1 / e1 → ∀ k : ℕ, 0 < k →
          twoLevelOptCost d A1 A2 e1 e2 1 ≤ twoLevelOptCost d A1 A2 e1 e2 k) := by sorry

end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 177, Sect. 9.2.1, the paragraph after Eq. (9.13): 'It is optimal to choose k = k' if k*/k' <= (k' + 1)/k*. Otherwise k = k' + 1 is optimal. If A1/e1 >= A2/e2 we get k = 1'
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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