Lemma 3: the cost of L consecutive periods from state (x, 𝓘)
ProvedLostSalesConstantOrder.LargeLeadTime.lemma_3Consider the lost-sales system with lead time , holding cost , penalty and i.i.d. demands with law (finite third moment, not deterministic). Fix a period . For any admissible policy , the expected cost of the periods is the expectation, over the state , of the expected cost of those periods for the system started in that state:
Moreover, for every pipeline and initial inventory ,
where is the inventory at the end of the window started at and if , otherwise.
This is the paper's Lemma 3: is the conditional expectation . It is the explicit form of the cost of any consecutive periods on which every later comparison rests.
Formalization Note The conditioning on is rendered by starting the dynamics at (the demands of the window are independent of the state for every nonanticipative policy); the first conjunct states that this rendering integrates back to the policy's window cost. The window starts at Lean period , the paper's ; it is stated for every , which is the paper's range for all horizons . The right-hand side is a real number (the -term is the expected lost demand) mapped into with ENNReal.ofReal; its expectations are Bochner integrals of bounded integrands.
import Definitions.Def_LostSalesConstantOrder_LargeLeadTime_Model open MeasureTheory ProbabilityTheory Filter open scoped ENNReal NNReal BigOperators
namespace LostSalesConstantOrder.LargeLeadTime
/-- Lemma 3, p. 6. First conjunct: for every admissible policy and every window start `t₀`
(the paper's `τ = t₀ + 1`), the expected cost of the `L` periods `t₀, …, t₀ + L − 1` is the
expectation of `windowCost` at the state `(x^π_τ, I^π_τ)`; this is how the conditional expectation
`E[· | x^π_τ = x, I^π_τ = 𝓘]` is rendered. Second conjunct: the formula of Lemma 3 for that
window cost started at pipeline `x` and inventory `𝓘` (`d (i − 1)` is `D_{τ+i−1}`, `slot x (i − 1)` is
`x_i`). -/
theorem lemma_3 (P : CappedBaseStock.DemandLaw) (prm : CappedBaseStock.Parameters)
(h3 : FiniteThirdMoment P) (hnd : NonDeterministic P) :
(∀ (π : CappedBaseStock.AdmissiblePolicy) (t₀ : ℕ),
costWindow P prm π t₀ =
∫⁻ ω, windowCost P prm (CappedBaseStock.run prm π ω t₀).2
(CappedBaseStock.run prm π ω t₀).1 ∂CappedBaseStock.sampleLaw P) ∧
∀ (x : Fin prm.L → ℝ≥0) (I : ℝ≥0),
windowCost P prm x I =
ENNReal.ofReal
(prm.h * ∑ k ∈ Finset.Icc 1 prm.L,
∫ d, (Finset.range (k + 1)).sup' Finset.nonempty_range_add_one
(fun j => (∑ i ∈ Finset.Icc (k + 1 - j) k,
((slot x (i - 1) : ℝ) - (d (i - 1) : ℝ))) +
if j = k then (I : ℝ) else 0) ∂CappedBaseStock.demandPathLaw P +
prm.p * ((∫ d, (endInventory prm x I d : ℝ) ∂CappedBaseStock.demandPathLaw P) -
I + prm.L * CappedBaseStock.mean P - ∑ i, (x i : ℝ))) := by sorry
end LostSalesConstantOrder.LargeLeadTime
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.