Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Online Supplement A, p. 34 — at û the zero vector is not optimal for the relaxation of (10)

Proved
ConstrNestedLogit.UpperBound.relax_opt_ne_zero

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

assortment-optimizationknapsacknested-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\gamma_i > 0γi​>0. 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​ and let zzz be a real number with Ri(S)>zR_i(S) > zRi​(S)>z. Then the zero vector is not an optimal solution of the linear programming relaxation of the knapsack problem (10) of nest iii at

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

In the proof of Proposition 7 this rules out the case xig=0ˉx_i^g = \bar 0xig​=0ˉ, so the chain of inequalities for a nonzero relaxation optimum always applies.

Formalization Note The positivity vij>0v_{ij} > 0vij​>0 is an added hypothesis. The paper's argument passes through "rij≤u^r_{ij} \le \hat urij​≤u^ for all jjj"; the statement records the conclusion of that argument, that 000 is not optimal.

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 (p. 34): let `S` be a nonempty assortment
satisfying the space constraint of nest `i` with `R_i(S) > z`, and put
`û = γ_i z + (1 − γ_i) R_i(S)` with `γ_i > 0`. Then the zero vector is not an optimal solution of
the linear programming relaxation of the knapsack problem (10) at `u = û`. -/
theorem relax_opt_ne_zero {ι : 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)
    (S : Finset (Fin n)) (hS : SpaceFeasible w c i S) (hSne : S.Nonempty)
    (z : ℝ) (hRz : z < R I i S) :
    ¬ RelaxOptimal I w c i (I.γ i * z + (1 - I.γ i) * R I i S) 0 := 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, p. 34, Online Supplement A, proof of Proposition 7 (case x_i^g = 0̄)
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