Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.2 (restated) — revenue-ordered assortments are robust: S*(V) = {i : rᵢ > Z*(V)}

Proved
RobustMNL.Dynamic.revenue_ordered_robust

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

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

Let V⊆R++n+1\mathcal V \subseteq \mathbb R^{n+1}_{++}V⊆R++n+1​ be a compact nonempty uncertainty set and let r1,…,rnr_1, \dots, r_nr1​,…,rn​ be arbitrary real revenues. An assortment SSS is an optimal assortment of the Robust Logit problem with the smallest cardinality among optimal assortments if and only if

S={ i∈A:ri>Z∗(V) }.S = \{\, i \in \mathcal A : r_i > Z^*(\mathcal V) \,\}.S={i∈A:ri​>Z∗(V)}.

In particular the threshold set is optimal, and it is the unique optimal assortment of smallest cardinality.

The robust assortment is therefore revenue-ordered, exactly as in the case of known parameters. In Section 4 this is applied period by period with revenues ri−ΔJt+1(x)r_i - \Delta J_{t+1}(x)ri​−ΔJt+1​(x).

Formalization Note The paper writes "V⊂R++nV \subset \mathbb R^n_{++}V⊂R++n​"; the parameter vector has n+1n+1n+1 components and the standing assumption of Sec. 3 is a compact V⊆R++n+1V \subseteq \mathbb R^{n+1}_{++}V⊆R++n+1​, which is stated here (with nonemptiness, implicit in min⁡v∈V\min_{v\in V}minv∈V​). The theorem is stated for arbitrary real revenues; the paper's ordering r1≥⋯≥rn>0r_1 \ge \dots \ge r_n > 0r1​≥⋯≥rn​>0 is "without loss of generality", is used by no step of the proof, and Section 4 needs revenues ri−ΔJt+1(x)r_i - \Delta J_{t+1}(x)ri​−ΔJt+1​(x) that may be negative. S∗(V)S^*(\mathcal V)S∗(V) is the predicate IsSmallestOptimal; the "↔" asserts both that every such SSS is the threshold set and that the threshold set is one. This restates RobustMNL.Static.revenue_ordered_robust of the companion mission verbatim up to namespace.

Preamble
import Mathlib
import Definitions.Def_RobustMNL_Dynamic_StaticModel
Formal statement
namespace RobustMNL.Dynamic

theorem revenue_ordered_robust {n : ℕ} (r : Fin n → ℝ) (V : Set (ℝ × (Fin n → ℝ)))
    (hV : IsCompact V) (hne : V.Nonempty) (hpos : ∀ p ∈ V, RobustMNL.Static.IsPos p) (S : Finset (Fin n)) :
    RobustMNL.Static.IsSmallestOptimal V r S ↔ S = Finset.univ.filter (fun i => RobustMNL.Static.Zstar V r < r i) := 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.2, p. 7
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