The sequential minimization (6.26) can be carried out: a sequentially optimal base-stock vector exists
ProvedSupplyChainTheory.cs_sequential_existsexistencemultiechelonoperations-researchsupply-chain
For echelon holding costs , stockout cost and lead-time demands of finite mean, there is a base-stock vector such that each minimizes over , .
Theorem 6.3 defines as and presupposes that the minimum is attained. It is: each is convex, grows at least linearly to the right because and to the left because the stockout term propagates through the recursion, so the sequential construction never stalls. Since depends only on , the minimizers can be chosen one stage at a time.
Preamble
import Definitions.Def_SupplyChainTheory_multiechelon
Formal statement
namespace SupplyChainTheory
theorem cs_sequential_exists (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) :
∃ S : ℕ → ℝ, CSSequential N h p D S := by sorry
end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, p. 196, Sect. 6.2.2, Theorem 6.3, Eq. (6.26) 'S*j = argmin{gj(y)}'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.