Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.6 β€” largest optimal assortment is robust: S*(𝒱) = ⋃_{vβˆˆπ’±} S*_v

Proved
RobustMNL.Static.largest_optimal_robust

by mikedeng1 Β· Oct 7, 2026 Β· Mathlib 0df444a (Lean v4.33.1)

assortment-optimizationmultinomial-logitp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

The largest optimal assortment is robust. Let VβŠ†R++n+1\mathcal V \subseteq \mathbb R^{n+1}_{++}VβŠ†R++n+1​ be compact and nonempty. Then the smallest optimal robust assortment is the union of the optimal assortments under the individual parameter vectors in V\mathcal VV:

Sβˆ—(V)=⋃v∈VSvβˆ—,S^*(\mathcal V) = \bigcup_{v \in \mathcal V} S^*_v,Sβˆ—(V)=v∈V⋃​Svβˆ—β€‹,

where Svβˆ—=Sβˆ—({v})S^*_v = S^*(\{v\})Svβˆ—β€‹=Sβˆ—({v}) is the optimal assortment of smallest cardinality when the parameters are known to equal vvv.

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 SSS for V\mathcal VV and every product iii: i∈Si \in Si∈S iff there are v∈Vv \in \mathcal Vv∈V and a smallest-cardinality optimal TTT for {v}\{v\}{v} with i∈Ti \in Ti∈T. By Theorem 3.2 such a TTT is unique, so "there is such a TTT" is the same as "for the TTT". The page writes "VβŠ†R++n\mathcal V \subseteq \mathbb R^n_{++}VβŠ†R++n​"; it is read as compact nonempty VβŠ†R++n+1\mathcal V \subseteq \mathbb R^{n+1}_{++}VβŠ†R++n+1​ (the proof uses compactness). Revenues are arbitrary reals; products are Fin n.

Preamble
import Mathlib
import Definitions.Def_RobustMNL_Static_Model
Formal statement
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
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.6, p. 10
Human review
  • Endorsed by Shuze Chen Β· Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 Β· Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
Β© 2026 Prove2Me