Theorem 3.8 — for V = ∏_{i=0}^n [l_i, u_i], Y*(V) = max_{S⊆A:|S|≤K} f(S, (u₀, l₁, …, lₙ))
ProvedRobustMNL.SizeCon.rectangular_size_constrainedTheorem 3.8 (Robust size-constrained assortment under rectangular uncertainty sets). Let be a set of products with real revenues , and let be the largest allowable assortment size. Let be a rectangular uncertainty set for the MNL parameters : and for each product . Then
The size-constrained robust problem appears intractable for a general uncertainty set; over a box it reduces to a size-constrained assortment problem with the known weights , which can be solved efficiently.
Formalization Note Both maxima range over all subsets of size at most (any , including and ), and the minimum over the whole box, as a real infimum. The middle expression is written out, so the Lean statement is the single equality between the left and right ends. The hypotheses , say the intervals are nonempty (the paper's intervals are ranges of likely values); , express . Revenues are arbitrary reals; the paper's ordering is used by no proof and is dropped, a strengthening. Products are 0-indexed (Fin n).
import Mathlib import Definitions.Def_ChoiceCDLP_MNL_mnlObjective import Definitions.Def_RobustMNL_SizeCon_Model
namespace RobustMNL.SizeCon
/-- Theorem 3.8, p. 11 (Robust Size-Constrained Assortment under Rectangular Uncertainty Sets):
for `V = ∏_{i=0}^n [l_i, u_i] ⊆ ℝⁿ⁺¹₊₊`,
`Y*(V) = max_{S ⊆ 𝒜 : |S| ≤ K} f(S, (u₀, l₁, …, lₙ))`. -/
theorem rectangular_size_constrained {n : ℕ} (l₀ u₀ : ℝ) (l u : Fin n → ℝ) (hl₀ : 0 < l₀)
(hlu₀ : l₀ ≤ u₀) (hl : ∀ i, 0 < l i) (hlu : l ≤ u) (r : Fin n → ℝ) (K : ℕ) :
Ystar (box l₀ u₀ l u) r K = knownMax r K (u₀, l) := by sorry
end RobustMNL.SizeCon
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.