Theorem 6.5: in a guaranteed-service serial system with , every stage quotes or
ProvedSupplyChainTheory.gs_all_or_nothingTheorem 6.5. In the guaranteed-service serial system of Sect. 6.3.4, with holding costs , , processing times and external inbound time , suppose (immediate service is required to the customer). If with minimizes the holding cost over all feasible committed service times with , then for all ,
with . Each stage follows an all-or-nothing policy: it either holds no safety stock and quotes the longest possible service time, or holds the most safety stock and quotes zero. The book omits the proof (Problem 6.6); the cost is concave in every and strictly concave along every direction that changes some net lead time, so a minimizer is a vertex of the feasible polytope, and with every vertex has this form. The book notes the property fails for tree systems (Figure 6.11).
Formalization Note The service times are real rather than integer. Since the vertices of the feasible region are integral when the and are, every integer-optimal vector is also optimal over the reals, so the real statement contains the book's integer one.
import Definitions.Def_SupplyChainTheory_multiechelon
namespace SupplyChainTheory
theorem gs_all_or_nothing (N : ℕ) (h : ℕ → ℝ) (k : ℝ) (T : ℕ → ℝ) (SIN : ℝ)
(hk : 0 < k) (hh : ∀ i ∈ Finset.Icc 1 N, 0 < h i) (hT : ∀ i, 0 ≤ T i) (hSI : 0 ≤ SIN)
(S : ℕ → ℝ) (hS1 : S 1 = 0) (hfeas : GSFeasible N T SIN S)
(hopt : ∀ S' : ℕ → ℝ, S' 1 = 0 → GSFeasible N T SIN S' →
gsCost N h k T SIN S ≤ gsCost N h k T SIN S') :
∀ i ∈ Finset.Icc 2 N, S i = 0 ∨ S i = gsInbound N SIN S i + T i := by sorry
end SupplyChainTheory
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.