Sect. 9.2.2, pp. 180-181: if then in the relaxed optimum
ProvedInventoryControl.serial_aggregationconvex-optimizationinventory-controllot-sizingmulti-echelonoperations-research
Let be an optimal solution of the relaxed serial problem, minimizing the cost (9.17) over positive batch quantities with , for . If for two consecutive stages
equivalently if the unconstrained optima satisfy , then the constraint between them is tight: .
The book's argument is by contradiction from convexity: if in the optimum, then (otherwise reducing would lower the cost while keeping the constraints) and , so . It is the justification of the aggregation algorithm: two such stages are merged into one with ordering cost and echelon holding cost , and the relaxed optimum is found by repeating this until the ratios are nondecreasing and applying the EOQ formula to each aggregate.
Preamble
import Definitions.Def_InventoryControl_serial
Formal statement
namespace InventoryControl
theorem serial_aggregation {N : ℕ} (A e : Fin N → ℝ) (d : ℝ) (hd : 0 < d)
(hA : ∀ i, 0 < A i) (he : ∀ i, 0 < e i) (Qrel : Fin N → ℝ) (hpos : ∀ i, 0 < Qrel i)
(hnest : SerialNested Qrel)
(hopt : ∀ Q : Fin N → ℝ, (∀ i, 0 < Q i) → SerialNested Q →
serialCost A e d Qrel ≤ serialCost A e d Q)
(i j : Fin N) (hij : j.val = i.val + 1) (hratio : A j / e j < A i / e i) :
Qrel j = Qrel i := by sorry
end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, pp. 180-181, Sect. 9.2.2: 'Assume that for some i, Ai/ei < Ai-1/ei-1 ... Consequently, Qi = Qi-1 in the optimal solution of the relaxed problem'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.