Proof of Theorem 3.7, p. 11 — Z*(𝒱) ≤ Z*_δ(𝒱) ≤ δ + Z*(𝒱) for δ ≥ 0
ProvedRobustMNL.Static.incremental_value_boundsassortment-optimizationmultinomial-logitp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization
Let be compact and nonempty and let . Write for the optimal value of the Robust Logit problem when every product revenue is increased by ,
Then
Raising every revenue by raises the optimal worst-case revenue by at most , because a customer buys at most one product. This sandwich yields Theorem 3.7.
Formalization Note Since is the expected revenue computed with revenues , is written as Zstar V (fun i => r i + δ). Revenues are arbitrary reals; products are Fin n.
Preamble
import Mathlib import Definitions.Def_RobustMNL_Static_Model
Formal statement
namespace RobustMNL.Static
theorem incremental_value_bounds {n : ℕ} (r : Fin n → ℝ) (V : Set (ℝ × (Fin n → ℝ)))
(hV : IsCompact V) (hne : V.Nonempty) (hpos : ∀ p ∈ V, IsPos p) (δ : ℝ) (hδ : 0 ≤ δ) :
Zstar V r ≤ Zstar V (fun i => r i + δ) ∧ Zstar V (fun i => r i + δ) ≤ δ + Zstar V r := by sorry
end RobustMNL.Static
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, Proof of Theorem 3.7, p. 11, line after the first display (Z*_δ(V) defined on p. 10)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.