Eq. (9.12)-(9.13): is convex in and minimized at
ProvedInventoryControl.two_level_opt_kconvex-optimizationinventory-controllot-sizingmulti-echelonoperations-research
In the two-level serial system with , the optimal cost for a given ratio satisfies
this function of is convex on , and, disregarding that has to be an integer, is minimized over at
The square of the cost separates into a constant, a term linear in and a term proportional to , so the minimization over is once more an EOQ-shaped problem. The value does not depend on the demand , 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.