Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.8, p. 12 — Y*(V) = max{λ : max_{|S|≤K} min_{v∈V} (1/v₀) Σ_{i∈S} v_i (r_i − λ) ≥ λ}

Proved
RobustMNL.SizeCon.parametric_form

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

assortment-optimizationfractional-programmingmultinomial-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 set of positive MNL parameter vectors v=(v0,v1,…,vn)v=(v_0,v_1,\dots,v_n)v=(v0​,v1​,…,vn​), let r1,…,rnr_1,\dots,r_nr1​,…,rn​ be real revenues and K∈NK\in\mathbb NK∈N a size limit. Write Y∗(V)=max⁡S⊆A: ∣S∣≤Kmin⁡v∈Vf(S,v)Y^*(\mathcal V)=\max_{S\subseteq\mathcal A:\,|S|\le K}\min_{v\in\mathcal V} f(S,v)Y∗(V)=maxS⊆A:∣S∣≤K​minv∈V​f(S,v) for the optimal value of the size-constrained robust problem. Then Y∗(V)Y^*(\mathcal V)Y∗(V) is the largest real number λ\lambdaλ satisfying

max⁡S: ∣S∣≤K min⁡v∈V 1v0∑i∈Svi (ri−λ) ≥ λ,\max_{S:\ |S|\le K}\ \min_{v\in\mathcal V}\ \frac{1}{v_0}\sum_{i\in S} v_i\,(r_i-\lambda)\ \ge\ \lambda ,S: ∣S∣≤Kmax​ v∈Vmin​ v0​1​i∈S∑​vi​(ri​−λ) ≥ λ,

that is,

Y∗(V)=max⁡{λ: max⁡S: ∣S∣≤K min⁡v∈V 1v0∑i∈Svi (ri−λ) ≥ λ}.Y^*(\mathcal V)=\max\Big\{\lambda:\ \max_{S:\ |S|\le K}\ \min_{v\in\mathcal V}\ \frac{1}{v_0}\sum_{i\in S} v_i\,(r_i-\lambda)\ \ge\ \lambda\Big\}.Y∗(V)=max{λ: S: ∣S∣≤Kmax​ v∈Vmin​ v0​1​i∈S∑​vi​(ri​−λ) ≥ λ}.

This parametric (Dinkelbach-type) description of Y∗Y^*Y∗ holds for every compact uncertainty set; it is the first step of the proof of Theorem 3.8, which then evaluates the left-hand side in closed form when V\mathcal VV is a box.

Formalization Note The "max" of the set of admissible λ\lambdaλ is IsGreatest: Y∗(V)Y^*(\mathcal V)Y∗(V) belongs to the set and bounds every member, so the maximum is attained. The inner min⁡\minmin is a real infimum over V\mathcal VV, attained under the stated hypotheses (compact, nonempty, every component positive). Revenues are arbitrary reals; the paper's ordering r1≥⋯≥rn>0r_1\ge\dots\ge r_n>0r1​≥⋯≥rn​>0 is not assumed. Products are 0-indexed (Fin n).

Preamble
import Mathlib
import Definitions.Def_ChoiceCDLP_MNL_mnlObjective
import Definitions.Def_RobustMNL_SizeCon_Model
Formal statement
namespace RobustMNL.SizeCon

/-- Proof of Theorem 3.8, p. 12, first display: for every compact, nonempty uncertainty set
`V ⊆ ℝⁿ⁺¹₊₊`, `Y*(V)` is the largest `λ` with
`λ ≤ max_{S : |S| ≤ K} min_{v ∈ V} (1/v₀) ∑_{i ∈ S} v_i (r_i − λ)`. -/
theorem parametric_form {n : ℕ} (V : Set (ℝ × (Fin n → ℝ))) (hVc : IsCompact V)
    (hVne : V.Nonempty) (hVpos : ∀ p ∈ V, RobustMNL.Static.IsPos p) (r : Fin n → ℝ) (K : ℕ) :
    IsGreatest {lam : ℝ | lam ≤ paramValue V r K lam} (Ystar V r K) := by sorry

end RobustMNL.SizeCon
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.8, p. 12, first display (last line)
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