Lemma 7: the coupled lower bound on the cost of through
ProvedLostSalesConstantOrder.LargeLeadTime.lemma_7In the setting of Lemma 6 ( never orders more than , solves (4)), let , let be a copy of independent of the demands, and let be the largest index attaining . For every period , is at least
The coupling of with the index puts the lower bound in the same terms as the cost of the constant-order policy (Lemma 4).
Formalization Note As in Lemma 6, the statement is for every policy that never orders more than (the paper's is one) and every window start. The expectations are over the product of the law of and the demand law. No hypothesis is added (the paper states none); the integrands do not involve except through the index . The real right-hand side is mapped into with ENNReal.ofReal.
import Definitions.Def_LostSalesConstantOrder_LargeLeadTime_RandomWalk open MeasureTheory ProbabilityTheory Filter open scoped ENNReal NNReal BigOperators
namespace LostSalesConstantOrder.LargeLeadTime
/-- Lemma 7, p. 9. Hypotheses as in Lemma 6; `r* = L⁻¹ Σ x*_i` and `i^{r*}_k` is built from an
independent pair `(I^{r*}_{1,∞}, (D_i))`. Then `E[Σ_{t=τ}^{τ+L−1} C_t^π]` is at least
`h(Σ_k E[i^{r*}_k r* − Σ_{i=1}^{i^{r*}_k} D_i] + Σ_k E[Σ_{i=k+1−i^{r*}_k}^k x*_i] − r* Σ_k E[i^{r*}_k])
+ c(E[I*_{L+1}] − 𝓘* + L E[D] − Σ x*_i)`, all sums over `k = 1, …, L`. -/
theorem lemma_7 (P : CappedBaseStock.DemandLaw) (prm : CappedBaseStock.Parameters)
(h3 : FiniteThirdMoment P) (hnd : NonDeterministic P)
(π : CappedBaseStock.AdmissiblePolicy) (hπ : OrdersBounded P π (Qlevel P prm))
(x : Fin prm.L → ℝ≥0) (I : ℝ≥0) (hmin : IsWindowMinimizer P prm x I) (t₀ : ℕ) :
ENNReal.ofReal
(prm.h *
((∑ k ∈ Finset.Icc 1 prm.L,
∫ p, ((ik (rStar x) k p.1 p.2 : ℝ) * (rStar x : ℝ) -
∑ i ∈ Finset.Icc 1 (ik (rStar x) k p.1 p.2), (p.2 (i - 1) : ℝ)) ∂((lawSupWalk P (rStar x)).prod (CappedBaseStock.demandPathLaw P))) +
(∑ k ∈ Finset.Icc 1 prm.L,
∫ p, ∑ i ∈ Finset.Icc (k + 1 - ik (rStar x) k p.1 p.2) k, (slot x (i - 1) : ℝ) ∂((lawSupWalk P (rStar x)).prod (CappedBaseStock.demandPathLaw P))) -
(rStar x : ℝ) * ∑ k ∈ Finset.Icc 1 prm.L, ∫ p, (ik (rStar x) k p.1 p.2 : ℝ) ∂((lawSupWalk P (rStar x)).prod (CappedBaseStock.demandPathLaw P))) +
prm.p * ((∫ d, (endInventory prm x I d : ℝ) ∂CappedBaseStock.demandPathLaw P) -
I + prm.L * CappedBaseStock.mean P - ∑ i, (x i : ℝ))) ≤
costWindow P prm π t₀ := by sorry
end LostSalesConstantOrder.LargeLeadTime
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.