Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 3.4, p. 8 — for V = ∏[l_i, u_i], Z*(V) = max_{S⊆A} f(S, (u₀, l₁, …, lₙ))

Proved
RobustMNL.SizeCon.rectangular_unconstrained

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=∏i=0n[li,ui]⊆R++n+1\mathcal V=\prod_{i=0}^n [l_i,u_i]\subseteq\mathbb R^{n+1}_{++}V=∏i=0n​[li​,ui​]⊆R++n+1​ be a rectangular uncertainty set (0<l0≤u00<l_0\le u_00<l0​≤u0​, 0<li≤ui0<l_i\le u_i0<li​≤ui​) and r1,…,rnr_1,\dots,r_nr1​,…,rn​ real revenues. Then the optimal value of the (unconstrained) robust assortment problem equals the optimal revenue under the known parameter vector h=(u0,l1,…,ln)h=(u_0,l_1,\dots,l_n)h=(u0​,l1​,…,ln​):

Z∗(V)=max⁡S⊆A min⁡v∈Vf(S,v)=max⁡S⊆Af(S,(u0,l1,l2,…,ln)).Z^*(\mathcal V)=\max_{S\subseteq\mathcal A}\ \min_{v\in\mathcal V} f(S,v)=\max_{S\subseteq\mathcal A} f\big(S,(u_0,l_1,l_2,\dots,l_n)\big).Z∗(V)=S⊆Amax​ v∈Vmin​f(S,v)=S⊆Amax​f(S,(u0​,l1​,l2​,…,ln​)).

In words, the adversary facing a box picks the largest no-purchase weight and the smallest product weights, and the robust problem is an ordinary MNL assortment problem with these weights. It is the special case K≥nK\ge nK≥n of Theorem 3.8, which the paper establishes independently in Example 3.4.

Formalization Note The paper states the chain Z∗(V)=max⁡Sf(S,h)=f(Sh∗,h)Z^*(\mathcal V)=\max_S f(S,h)=f(S^*_h,h)Z∗(V)=maxS​f(S,h)=f(Sh∗​,h); the last expression is max⁡Sf(S,h)\max_S f(S,h)maxS​f(S,h) by the definition of Sh∗S^*_hSh∗​ as an optimal assortment under hhh, so the Lean statement keeps the first equality, the mathematical content. The minimum is a real infimum over the box; l0≤u0l_0\le u_0l0​≤u0​ and l≤ul\le ul≤u say the intervals are nonempty. Revenues are arbitrary reals. 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

/-- Example 3.4, p. 8: over the rectangular set `∏_{i=0}^n [l_i, u_i] ⊆ ℝⁿ⁺¹₊₊`,
`Z*(V) = max_{S ⊆ 𝒜} min_{v ∈ V} f(S, v) = max_{S ⊆ 𝒜} f(S, (u₀, l₁, …, lₙ))`. -/
theorem rectangular_unconstrained {n : ℕ} (l₀ u₀ : ℝ) (l u : Fin n → ℝ) (hl₀ : 0 < l₀)
    (hlu₀ : l₀ ≤ u₀) (hl : ∀ i, 0 < l i) (hlu : l ≤ u) (r : Fin n → ℝ) :
    RobustMNL.Static.Zstar (box l₀ u₀ l u) r =
      (Finset.univ : Finset (Finset (Fin n))).sup' Finset.univ_nonempty
        (fun S => RobustMNL.Static.rev r S (u₀, l)) := 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, Example 3.4, p. 8, displayed claim
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