Eq. (3) — the expected truncated first stockout time of a set of sizes is at most the minimum over its sizes
ProvedFastFashion.Approx.eq_3_min_boundinventoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stopping-time
In the setting of the model file (independent Poisson family with rates , period ), for every nonempty set of sizes and every ,
This is the first of the two approximation steps of §3.1.3, each of which produces an upper bound.
Formalization Note The paper writes "for any subset of sizes "; the subset is required to be nonempty here, since the minimum over the empty set has no value. is .
Preamble
import Mathlib import Definitions.Def_FastFashion_Structure_Model
Formal statement
namespace FastFashion.Approx
open MeasureTheory ProbabilityTheory
/-- Eq. (3) (Caro–Gallien, p. 12): for every nonempty set of sizes `D`,
`𝔼[τ_D ∧ T] ≤ min_{s ∈ D} 𝔼[τ_s ∧ T]`. -/
theorem eq_3_min_bound {S Ω : Type*} [MeasurableSpace Ω]
(P : Measure Ω) [IsProbabilityMeasure P] (lam : S → ℝ) (N : S → ℝ → Ω → ℕ)
(hN : FastFashion.Structure.IsPoissonFamily lam N P) (hlam : ∀ s, 0 < lam s) (T : ℝ) (hT : 0 < T)
(D : Finset S) (hD : D.Nonempty) (q : S → ℕ) :
FastFashion.Structure.hA N P T D q ≤ D.inf' hD (fun s => FastFashion.Structure.hA N P T {s} q) := by sorry
end FastFashion.Approx
Source
Caro & Gallien, Inventory Management of a Fast-Fashion Retail Network, working paper (August 2, 2007), p. 12, Eq. (3)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.