Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Online Supplement A, pp. 33–34 — the chain of inequalities for a nonzero relaxation optimum

Proved
ConstrNestedLogit.UpperBound.key_inequality

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

assortment-optimizationlinear-programmingnested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the nested logit model with preference weights vij>0v_{ij} > 0vij​>0, arbitrary revenues rijr_{ij}rij​ and no within-nest no-purchase weight, and fix a nest iii with γi∈(0,1]\gamma_i \in (0, 1]γi​∈(0,1]. Let SSS be a nonempty assortment satisfying the space constraint ∑j∈Swij≤ci\sum_{j \in S} w_{ij} \le c_i∑j∈S​wij​≤ci​, let zzz be a real number with Ri(S)>zR_i(S) > zRi​(S)>z, and set

u^=γi z+(1−γi) Ri(S).\hat u = \gamma_i\, z + (1 - \gamma_i)\, R_i(S).u^=γi​z+(1−γi​)Ri​(S).

If x≠0x \ne 0x=0 is an optimal solution of the linear programming relaxation of the knapsack problem (10) of nest iii at u=u^u = \hat uu=u^, then, writing Vi(x)=∑jvijxjV_i(x) = \sum_j v_{ij} x_jVi​(x)=∑j​vij​xj​ and Ri(x)=∑jvijrijxj/Vi(x)R_i(x) = \sum_j v_{ij} r_{ij} x_j / V_i(x)Ri​(x)=∑j​vij​rij​xj​/Vi​(x),

Vi(x)γi(Ri(x)−z)  ≥  Vi(S)γi(Ri(S)−z).V_i(x)^{\gamma_i}\big(R_i(x) - z\big) \;\ge\; V_i(S)^{\gamma_i}\big(R_i(S) - z\big).Vi​(x)γi​(Ri​(x)−z)≥Vi​(S)γi​(Ri​(S)−z).

This is the first and last link of the chain of inequalities in the proof of Proposition 7; together with a constraint of the linear program (13), it gives the proof's claim in the case xig≠0ˉx_i^g \ne \bar 0xig​=0ˉ.

Formalization Note The left side is the published NestedLogitVariants.General.F I i x z, which equals the displayed term because vi0=0v_{i0} = 0vi0​=0. The positivity vij>0v_{ij} > 0vij​>0 is an added hypothesis.

Preamble
import Mathlib
import Definitions.Def_NestedLogitVariants_General_Model
import Definitions.Def_NestedLogitVariants_General_Relaxation
import Definitions.Def_ConstrNestedLogit_UpperBound_Relaxation
import Definitions.Def_ConstrNestedLogit_UpperBound_LP13

open NestedLogitVariants.General
Formal statement
namespace ConstrNestedLogit.UpperBound

/-- Online Supplement A, proof of Proposition 7 (pp. 33–34), the chain of inequalities: let
`γ_i ∈ (0, 1]`, let `S` be a nonempty assortment satisfying the space constraint of nest `i` with
`R_i(S) > z`, put `û = γ_i z + (1 − γ_i) R_i(S)`, and let `x ≠ 0` be an optimal solution of the
linear programming relaxation of (10) at `û`. Then
`V_i(x)^{γ_i} (R_i(x) − z) ≥ V_i(S)^{γ_i} (R_i(S) − z)`, where the left side is `F I i x z`. -/
theorem key_inequality {ι : Type*} {n : ℕ} (I : Instance ι n)
    (hvnp : ∀ i, I.vnp i = 0) (hv : ∀ i j, 0 < I.v i j)
    (w : ι → Fin n → ℝ) (c : ι → ℝ) (i : ι) (hγ : 0 < I.γ i ∧ I.γ i ≤ 1)
    (S : Finset (Fin n)) (hS : SpaceFeasible w c i S) (hSne : S.Nonempty)
    (z : ℝ) (hRz : z < R I i S) (x : Fin n → ℝ)
    (hx : RelaxOptimal I w c i (I.γ i * z + (1 - I.γ i) * R I i S) x) (hx0 : x ≠ 0) :
    nestWeight I i S * (R I i S - z) ≤ F I i x z := by sorry

end ConstrNestedLogit.UpperBound
Source
Gallego & Topaloglu, Constrained Assortment Optimization for the Nested Logit Model, Management Science (2014), DOI 10.1287/mnsc.2014.1931; authors' manuscript of Sept. 11, 2013, pp. 33–34, Online Supplement A, proof of Proposition 7 (chain of inequalities)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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