Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.8, p. 12 — for a box, max_{|S|≤K} min_v (1/v₀) Σ v_i (r_i − λ) = max_{|S|≤K} (1/u₀) Σ l_i (r_i − λ)

Proved
RobustMNL.SizeCon.rectangular_reduction

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​ and 0<li≤ui0<l_i\le u_i0<li​≤ui​ for every product iii, the no-purchase weight v0v_0v0​ ranges over [l0,u0][l_0,u_0][l0​,u0​] and the weight viv_ivi​ of product iii over [li,ui][l_i,u_i][li​,ui​]. Let r1,…,rnr_1,\dots,r_nr1​,…,rn​ be real revenues and K∈NK\in\mathbb NK∈N. Then for every real λ\lambdaλ,

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

The right-hand side is the same parametric quantity evaluated at the single parameter vector (u0,l1,…,ln)(u_0,l_1,\dots,l_n)(u0​,l1​,…,ln​), so over a box the robust parametric problem collapses to a problem with known weights. The equality holds only after the maximum over assortments: for a fixed SSS containing a product with ri<λr_i<\lambdari​<λ the two inner quantities differ.

Formalization Note The inner minimum is a real infimum over the box. The hypotheses l0≤u0l_0\le u_0l0​≤u0​ and l≤ul\le ul≤u (componentwise) say that each interval is nonempty, the reading of "the interval [li,ui][l_i,u_i][li​,ui​] represents the range of the likely values"; 0<l00<l_00<l0​ and 0<li0<l_i0<li​ express [li,ui]⊂R++[l_i,u_i]\subset\mathbb R_{++}[li​,ui​]⊂R++​. 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

/-- Proof of Theorem 3.8, p. 12, second display: over the rectangular set
`∏_{i=0}^n [l_i, u_i] ⊆ ℝⁿ⁺¹₊₊`, for every real `λ`,
`max_{|S| ≤ K} min_{v ∈ V} (1/v₀) ∑_{i ∈ S} v_i (r_i − λ) = max_{|S| ≤ K} (1/u₀) ∑_{i ∈ S} l_i (r_i − λ)`. -/
theorem rectangular_reduction {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 : ℕ) (lam : ℝ) :
    paramValue (box l₀ u₀ l u) r K lam =
      (sizeFeasible n K).sup' (sizeFeasible_nonempty n K)
        (fun S => (1 / u₀) * ∑ i ∈ S, l i * (r i - lam)) := 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, second display (outer equality)
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