Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A.4, p. 46 — the optimal x̂ of the restricted LP (4) with the collection {N^k_ij} ∪ {{j}} is nonnegative

Proved
NestedLogitVariants.General.xh_nonneg

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

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

Consider a nested logit instance satisfying the standing assumptions, with γˉ=max⁡iγi>1\bar\gamma=\max_i\gamma_i>1γˉ​=maxi​γi​>1 (the standing assumption of §6). Let (x^,y^)(\hat x,\hat y)(x^,y^​) be an optimal solution of the linear program (4) in which the candidate collection of every nest iii is {Nijk:k∈N, j=0,…,k}∪{{j}:j∈N}\{N^k_{ij} : k\in N,\ j=0,\dots,k\}\cup\{\{j\}:j\in N\}{Nijk​:k∈N, j=0,…,k}∪{{j}:j∈N}. Then

x^ ≥ 0.\hat x\ \ge\ 0 .x^ ≥ 0.

This is the first step of the proof of Theorem 11; the cases of that proof multiply constraints by x^\hat xx^ and use its sign.

Formalization Note The page states this for the optimal solution of (4) and gives no further hypotheses; none is added here (in particular no n≥1n\ge1n≥1: for n=0n=0n=0 an optimal solution of (4) does not exist when there is a nest).

Preamble
import Mathlib
import Definitions.Def_NestedLogitVariants_General_Model
import Definitions.Def_NestedLogitVariants_General_NestedPR
Formal statement
namespace NestedLogitVariants.General

/-- Appendix A.4 (p. 46): an optimal solution `(x̂, ŷ)` of (4) with the candidate collections
`{N^k_ij} ∪ {{j}}` has `x̂ ≥ 0`. -/
theorem xh_nonneg {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n)
    (hI : I.Standing)
    (hsyn : ∃ i, 1 < I.γ i)
    (xh : ℝ) (yh : ι → ℝ) (hopt : LP4Optimal I (candidatesPR I) xh yh) :
    0 ≤ xh := by sorry

end NestedLogitVariants.General
Source
Davis, Gallego, Topaloglu, Assortment optimization under variants of the nested logit model, revised manuscript of June 18, 2013 (published Oper. Res. 62(2), 2014, DOI 10.1287/opre.2014.1256), p. 46, Appendix A.4, first paragraph
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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