Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (9.10)-(9.11): for a given kkk, Q1=2(A1+A2/k)d/(e1+ke2)Q_1 = \sqrt{2(A_1 + A_2/k)d/(e_1 + ke_2)}Q1​=2(A1​+A2​/k)d/(e1​+ke2​)​ and C(k)=2(A1+A2/k)d(e1+ke2)C(k) = \sqrt{2(A_1 + A_2/k)d(e_1 + ke_2)}C(k)=2(A1​+A2​/k)d(e1​+ke2​)​

Proved
InventoryControl.two_level_opt_Q1

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

inventory-controllot-sizingmulti-echelonoperations-research

In the two-level serial system with final demand d>0d > 0d>0, ordering costs A1,A2>0A_1, A_2 > 0A1​,A2​>0, echelon holding costs e1,e2>0e_1, e_2 > 0e1​,e2​>0 and a given ratio k>0k > 0k>0, the batch quantity of item 1 that minimizes the cost (9.9) over Q1>0Q_1 > 0Q1​>0 is

Q1  =  2(A1+A2/k) de1+ke2,Q_1 \;=\; \sqrt{\frac{2(A_1 + A_2/k)\,d}{e_1 + ke_2}},Q1​=e1​+ke2​2(A1​+A2​/k)d​​,

and the resulting cost is

C(k)  =  2 (A1+A2/k) d (e1+ke2).C(k) \;=\; \sqrt{2\,(A_1 + A_2/k)\,d\,(e_1 + ke_2)}.C(k)=2(A1​+A2​/k)d(e1​+ke2​)​.

Both are the classical EOQ formulas (4.3)-(4.4) with the ordering cost AAA replaced by A1′=A1+A2/kA_1' = A_1 + A_2/kA1′​=A1​+A2​/k (Eq. 9.14) and the holding cost hhh by h1′=e1+ke2h_1' = e_1 + ke_2h1′​=e1​+ke2​ (Eq. 9.15), which is how the book explains them; they are also the modified parameters that Blackburn and Millen's sequential heuristic of Sect. 9.3.2 feeds to the Wagner-Whitin algorithm.

Formalization Note The optimal Q1Q_1Q1​ is eoq (A1 + A2/k) d (e1 + k e2) from the chapter 4 definitions, and the claim reduces to the published eoq_optimal and eoq_cost_at_eoq.

Preamble
import Definitions.Def_InventoryControl_serial
Formal statement
namespace InventoryControl

theorem two_level_opt_Q1 (d A1 A2 e1 e2 k Q1 : ℝ) (hd : 0 < d) (hA1 : 0 < A1) (hA2 : 0 < A2)
    (he1 : 0 < e1) (he2 : 0 < e2) (hk : 0 < k) (hQ : 0 < Q1) :
    twoLevelCost d A1 A2 e1 e2 (eoq (A1 + A2 / k) d (e1 + k * e2)) k
        ≤ twoLevelCost d A1 A2 e1 e2 Q1 k
      ∧ twoLevelCost d A1 A2 e1 e2 (eoq (A1 + A2 / k) d (e1 + k * e2)) k
          = 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.10) and Eq. (9.11)
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