The relaxed problem (9.17) subject to (9.18) has an optimal solution
ProvedInventoryControl.serial_relaxed_min_existsFor a serial system with stages, final demand , ordering costs and echelon holding costs , there are positive nested batch quantities that minimize the cost (9.17) over all positive batch quantities satisfying the relaxed constraints (9.18).
The book speaks of "the unique solution of the relaxed problem" and computes it by aggregation; that a minimum exists is presupposed. It does because each term tends to infinity as or , so the search can be confined to a compact box, on which the continuous objective attains its minimum, and the constraint set is closed. Positivity of every and is needed: with the cost decreases without bound as , and with as .
Formalization Note Uniqueness is not asserted here.
import Definitions.Def_InventoryControl_serial
namespace InventoryControl
theorem serial_relaxed_min_exists {N : ℕ} (A e : Fin N → ℝ) (d : ℝ) (hd : 0 < d)
(hA : ∀ i, 0 < A i) (he : ∀ i, 0 < e i) :
∃ Qrel : Fin N → ℝ, (∀ i, 0 < Qrel i) ∧ SerialNested Qrel ∧
∀ Q : Fin N → ℝ, (∀ i, 0 < Q i) → SerialNested Q →
serialCost A e d Qrel ≤ serialCost A e d Q := by sorry
end InventoryControl
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.