Eq. (9.10)-(9.11): for a given , and
ProvedInventoryControl.two_level_opt_Q1inventory-controllot-sizingmulti-echelonoperations-research
In the two-level serial system with final demand , ordering costs , echelon holding costs and a given ratio , the batch quantity of item 1 that minimizes the cost (9.9) over is
and the resulting cost is
Both are the classical EOQ formulas (4.3)-(4.4) with the ordering cost replaced by (Eq. 9.14) and the holding cost by (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 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.