Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.8, p. 12 — max_{|S|≤K} f(S, (u₀, l)) = max{λ : max_{|S|≤K} (1/u₀) Σ l_i (r_i − λ) ≥ λ}

Proved
RobustMNL.SizeCon.known_weights_parametric

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

assortment-optimizationfractional-programmingmultinomial-logitp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let u0>0u_0>0u0​>0 and l1,…,ln>0l_1,\dots,l_n>0l1​,…,ln​>0, let r1,…,rnr_1,\dots,r_nr1​,…,rn​ be real revenues and K∈NK\in\mathbb NK∈N. Write h=(u0,l1,…,ln)h=(u_0,l_1,\dots,l_n)h=(u0​,l1​,…,ln​) and f(S,h)=∑i∈Sliri/(u0+∑i∈Sli)f(S,h)=\sum_{i\in S} l_i r_i/(u_0+\sum_{i\in S} l_i)f(S,h)=∑i∈S​li​ri​/(u0​+∑i∈S​li​) for the MNL revenue of SSS under the known weights hhh. Then

max⁡S⊆A: ∣S∣≤Kf(S,h)  =  max⁡{λ: max⁡S: ∣S∣≤K 1u0∑i∈Sli (ri−λ) ≥ λ}.\max_{S\subseteq\mathcal A:\ |S|\le K} f(S,h) \;=\;\max\Big\{\lambda:\ \max_{S:\ |S|\le K}\ \frac{1}{u_0}\sum_{i\in S} l_i\,(r_i-\lambda)\ \ge\ \lambda\Big\}.S⊆A: ∣S∣≤Kmax​f(S,h)=max{λ: S: ∣S∣≤Kmax​ u0​1​i∈S∑​li​(ri​−λ) ≥ λ}.

This is the closing chain of the proof of Theorem 3.8: the parametric description of a size-constrained assortment problem with known weights. Combined with the parametric form of Y∗Y^*Y∗ and the rectangular reduction, it identifies Y∗Y^*Y∗ of a box with the known-weights optimum.

Formalization Note The "max" of the set of admissible λ\lambdaλ is IsGreatest. 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, last chain: for positive weights `(u₀, l₁, …, lₙ)`,
`max_{|S| ≤ K} f(S, (u₀, l))` is the largest `λ` with
`λ ≤ max_{|S| ≤ K} (1/u₀) ∑_{i ∈ S} l_i (r_i − λ)`. -/
theorem known_weights_parametric {n : ℕ} (u₀ : ℝ) (l : Fin n → ℝ) (hu₀ : 0 < u₀)
    (hl : ∀ i, 0 < l i) (r : Fin n → ℝ) (K : ℕ) :
    IsGreatest
      {lam : ℝ | lam ≤ (sizeFeasible n K).sup' (sizeFeasible_nonempty n K)
        (fun S => (1 / u₀) * ∑ i ∈ S, l i * (r i - lam))}
      (knownMax r K (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, proof of Theorem 3.8, p. 12, last display chain
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