Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (9.12)-(9.13): C(k)2C(k)^2C(k)2 is convex in kkk and minimized at k∗=A2e1/(A1e2)k^* = \sqrt{A_2e_1/(A_1e_2)}k∗=A2​e1​/(A1​e2​)​

Proved
InventoryControl.two_level_opt_k

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

convex-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, the optimal cost for a given ratio k>0k > 0k>0 satisfies

C(k)2  =  2d(A1e1+A2e2+A1e2 k+A2e1k),C(k)^2 \;=\; 2d\Big(A_1e_1 + A_2e_2 + A_1e_2\,k + \frac{A_2e_1}{k}\Big),C(k)2=2d(A1​e1​+A2​e2​+A1​e2​k+kA2​e1​​),

this function of kkk is convex on (0,∞)(0, \infty)(0,∞), and, disregarding that kkk has to be an integer, C(k)C(k)C(k) is minimized over k>0k > 0k>0 at

k∗  =  A2e1A1e2.k^{*} \;=\; \sqrt{\frac{A_2e_1}{A_1e_2}} .k∗=A1​e2​A2​e1​​​.

The square of the cost separates into a constant, a term linear in kkk and a term proportional to 1/k1/k1/k, so the minimization over kkk is once more an EOQ-shaped problem. The value k∗k^{*}k∗ does not depend on the demand ddd, which the book uses in Sect. 9.3.2 to carry the same ratio over to time-varying demand.

Preamble
import Definitions.Def_InventoryControl_serial
Formal statement
namespace InventoryControl

theorem two_level_opt_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 ^ 2
        = 2 * d * (A1 * e1 + A2 * e2 + A1 * e2 * k + A2 * e1 / k))
      ∧ ConvexOn ℝ (Set.Ioi 0) (fun k => twoLevelOptCost d A1 A2 e1 e2 k ^ 2)
      ∧ ∀ k : ℝ, 0 < k →
          twoLevelOptCost d A1 A2 e1 e2 (Real.sqrt (A2 * e1 / (A1 * e2)))
            ≤ 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, Eq. (9.12) and Eq. (9.13)
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