Corollary 3.5 (restated) — larger uncertainty implies a larger robust assortment: Z*(V′) ≤ Z*(V), S*(V) ⊆ S*(V′)
ProvedRobustMNL.Dynamic.larger_uncertaintyassortment-optimizationmultinomial-logitp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization
Let be compact, with nonempty, and let be arbitrary real revenues. Then
the latter for every optimal assortment of smallest cardinality over and every one over .
In Section 4 the inclusion compares the robust assortments of periods and when .
Formalization Note The paper writes ""; it is read as subsets of , compact by the standing assumption of Sec. 3. The proof of Theorem 4.3 (p. 18) cites Theorem 3.6 for this inclusion; the inclusion it uses is exactly this corollary's. This restates RobustMNL.Static.larger_uncertainty of the companion mission verbatim up to namespace.
Preamble
import Mathlib import Definitions.Def_RobustMNL_Dynamic_StaticModel
Formal statement
namespace RobustMNL.Dynamic
theorem larger_uncertainty {n : ℕ} (r : Fin n → ℝ) (V V' : Set (ℝ × (Fin n → ℝ)))
(hV : IsCompact V) (hne : V.Nonempty) (hpos : ∀ p ∈ V, RobustMNL.Static.IsPos p)
(hV' : IsCompact V') (hpos' : ∀ p ∈ V', RobustMNL.Static.IsPos p) (hsub : V ⊆ V') :
RobustMNL.Static.Zstar V' r ≤ RobustMNL.Static.Zstar V r ∧
∀ S S' : Finset (Fin n), RobustMNL.Static.IsSmallestOptimal V r S → RobustMNL.Static.IsSmallestOptimal V' r S' → S ⊆ S' := by sorry
end RobustMNL.Dynamic
Source
Rusmevichientong, Topaloglu, Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model, Operations Research (2012), doi:10.1287/opre.1120.1063, authors' manuscript of 20 Sep 2011, Corollary 3.5, p. 9
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.