Theorem 6.4 (Shang and Song): and
DisprovedSupplyChainTheory.shang_song_boundsTheorem 6.4 (Shang and Song 2003). In the serial system with echelon holding costs , stockout cost and lead-time demands of finite mean, let be built by the sequential minimization of Theorem 6.3 and let and be the truncated cost (6.31) with every local holding cost replaced by (lower) or by (upper): the single-stage newsvendor cost with demand and stockout cost , plus the holding cost of the pipeline stock at the replaced rate. Then for any and :
(a) ;
(b) , where, as the book says on p. 200, minimizes and minimizes : the cheaper holding rate of the lower bound has the larger fractile, so it is the upper base-stock bound.
The bounds come from the truncated system of (6.31): with all local holding costs equal, all inventory is held at stage 1 and the -stage system collapses to a single stage with lead time . Their average (6.32) is the Shang-Song heuristic, accurate to a fraction of a percent on the authors' test instances.
Formalization Note The bounding functions keep the pipeline holding cost that (6.31) charges on stock in transit; the book drops it when it writes the minimizers, since it does not affect them, but part (a) compares values and fails without it (in Example 6.1, while the single-stage cost alone is ). Part (b) asserts the existence of a minimizer of and a minimizer of bracketing ; when the fractiles of are unique these are the book's values. In Example 6.2 at : . Pairing the minimizers the other way would assert .
Retired. Retired because the demand laws were not required to be supported on [0, ∞), and with D₁ = δ₋₁ the upper bound of (a) fails (accepted disproof); replaced by SupplyChainTheory.shang_song_bounds_v2 with nonnegative demands.
import Definitions.Def_SupplyChainTheory_multiechelon
namespace SupplyChainTheory
theorem shang_song_bounds (N : ℕ) (h : ℕ → ℝ) (p : ℝ) (D : ℕ → MeasureTheory.Measure ℝ)
[∀ j, MeasureTheory.IsProbabilityMeasure (D j)]
(hD : ∀ j, MeasureTheory.Integrable (fun x => x) (D j))
(hh : ∀ j, 0 < h j) (hp : 0 < p) (Sstar : ℕ → ℝ) (hS : CSSequential N h p D Sstar)
(j : ℕ) (hj1 : 1 ≤ j) (hjN : j ≤ N) :
(∀ y, ssLower N h p D j y ≤ csG N h p D Sstar j y
∧ csG N h p D Sstar j y ≤ ssUpper N h p D j y)
∧ ∃ Sl Su : ℝ, IsMinOn (ssUpper N h p D j) Set.univ Sl
∧ IsMinOn (ssLower N h p D j) Set.univ Su ∧ Sl ≤ Sstar j ∧ Sstar j ≤ Su := by sorry
end SupplyChainTheory
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.