Theorem 3.7 (restated) — additive incremental revenues lead to a larger robust assortment: S*(V) ⊆ S*_δ(V)
ProvedRobustMNL.Dynamic.incremental_revenue_largerassortment-optimizationmultinomial-logitp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization
Let be compact and nonempty, let be arbitrary real revenues and . If is an optimal robust assortment of smallest cardinality for revenues , and is one for the revenues , then
In Section 4 this is used with (more capacity) and (a later period).
Formalization Note (p. 10) are the static objects at revenues fun i => r i + δ, the same numbers as the paper's . The uncertainty set is compact, nonempty, in (Sec. 3 standing assumption); revenues are arbitrary reals. This restates RobustMNL.Static.incremental_revenue_larger of the companion mission verbatim up to namespace.
Preamble
import Mathlib import Definitions.Def_RobustMNL_Dynamic_StaticModel
Formal statement
namespace RobustMNL.Dynamic
theorem incremental_revenue_larger {n : ℕ} (r : Fin n → ℝ) (V : Set (ℝ × (Fin n → ℝ)))
(hV : IsCompact V) (hne : V.Nonempty) (hpos : ∀ p ∈ V, RobustMNL.Static.IsPos p) (δ : ℝ) (hδ : 0 ≤ δ)
(S S' : Finset (Fin n)) (hS : RobustMNL.Static.IsSmallestOptimal V r S)
(hS' : RobustMNL.Static.IsSmallestOptimal V (fun i => r i + δ) 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, Theorem 3.7, p. 10 (Z*_δ, S*_δ defined on p. 10)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.