Appendix §5.1 — is supermodular
ProvedFastFashion.Structure.hA_supermodularinventoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stopping-timesupermodularity
Let be an independent Poisson family with rates on a probability space, and let . For every set of sizes , the function
is supermodular on the lattice : for all .
Together with identity (2), this gives the supermodularity of the expected sales function in Proposition 1.
Formalization Note Supermodularity is Topkis's notion, the published platform definition SupermodularOn with the whole lattice as domain.
Preamble
import Mathlib import Definitions.Def_FastFashion_Structure_Model import Definitions.Def_Supermodularity_Monotonicity_SupermodularOn
Formal statement
namespace FastFashion.Structure
open MeasureTheory ProbabilityTheory
theorem hA_supermodular {S Ω : Type*} [Fintype S] [DecidableEq S] [MeasurableSpace Ω]
(P : Measure Ω) [IsProbabilityMeasure P] (lam : S → ℝ) (N : S → ℝ → Ω → ℕ) (T : ℝ)
(hN : IsPoissonFamily lam N P) (hlam : ∀ s, 0 < lam s) (hT : 0 < T) :
∀ A : Finset S, Supermodularity.Monotonicity.SupermodularOn (hA N P T A) Set.univ := by sorry
end FastFashion.Structure
Source
Caro & Gallien, Inventory Management of a Fast-Fashion Retail Network, working paper (August 2, 2007), p. 31, Appendix §5.1, Proof of Proposition 1, last paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.