Theorem 3.6 β largest optimal assortment is robust: S*(π±) = β_{vβπ±} S*_v
ProvedRobustMNL.Static.largest_optimal_robustThe largest optimal assortment is robust. Let be compact and nonempty. Then the smallest optimal robust assortment is the union of the optimal assortments under the individual parameter vectors in :
where is the optimal assortment of smallest cardinality when the parameters are known to equal .
The robust assortment is thus the largest of the assortments that are optimal for some parameter vector in the uncertainty set.
Formalization Note For every smallest-cardinality optimal for and every product : iff there are and a smallest-cardinality optimal for with . By Theorem 3.2 such a is unique, so "there is such a " is the same as "for the ". The page writes ""; it is read as compact nonempty (the proof uses compactness). Revenues are arbitrary reals; products are Fin n.
import Mathlib import Definitions.Def_RobustMNL_Static_Model
namespace RobustMNL.Static
theorem largest_optimal_robust {n : β} (r : Fin n β β) (V : Set (β Γ (Fin n β β)))
(hV : IsCompact V) (hne : V.Nonempty) (hpos : β p β V, IsPos p) (S : Finset (Fin n))
(hS : IsSmallestOptimal V r S) (i : Fin n) :
i β S β β p β V, β T : Finset (Fin n), IsSmallestOptimal {p} r T β§ i β T := by sorry
end RobustMNL.Static
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.