Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 12 — at an optimum of (4) the first constraint binds and x̂ = Π(Ŝ_1, …, Ŝ_m)

Proved
NestedLogitVariants.LP.lp4_opt_binding

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

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

Assume v0>0v_0 > 0v0​>0. Let (x^,y^)(\hat x, \hat y)(x^,y^​) be an optimal solution of the linear program (4) with candidate collections {Ait:t∈Ti}\{A_{it} : t \in \mathcal T_i\}{Ait​:t∈Ti​}, and for every nest iii let S^i\hat S_iS^i​ be a member of the collection of nest iii that maximizes Vi(Si)γi(Ri(Si)−x^)V_i(S_i)^{\gamma_i}(R_i(S_i) - \hat x)Vi​(Si​)γi​(Ri​(Si​)−x^) over that collection. Then

v0 x^=∑i∈MVi(S^i)γi(Ri(S^i)−x^)andx^=Π(S^1,…,S^m).v_0\,\hat x = \sum_{i\in M} V_i(\hat S_i)^{\gamma_i}\big(R_i(\hat S_i) - \hat x\big) \qquad\text{and}\qquad \hat x = \Pi(\hat S_1, \dots, \hat S_m).v0​x^=i∈M∑​Vi​(S^i​)γi​(Ri​(S^i​)−x^)andx^=Π(S^1​,…,S^m​).

So the expected revenue of the assortment stitched together from the maximizers is exactly the optimal value of (4).

Formalization Note The hypothesis v0>0v_0 > 0v0​>0 is added. The page allows v0=0v_0 = 0v0​=0, but its step "solving for x^\hat xx^" divides by v0+∑iVi(S^i)γiv_0 + \sum_i V_i(\hat S_i)^{\gamma_i}v0​+∑i​Vi​(S^i​)γi​, which can vanish then, and the conclusion fails: one nest, v10=0v_{10} = 0v10​=0, γ1=1\gamma_1 = 1γ1​=1, one product with r11=v11=1r_{11} = v_{11} = 1r11​=v11​=1, candidates {∅,{1}}\{\emptyset, \{1\}\}{∅,{1}}; then x^=1\hat x = 1x^=1 and S^1=∅\hat S_1 = \emptysetS^1​=∅ is a maximizer, but Π(∅)=0\Pi(\emptyset) = 0Π(∅)=0. The standing assumptions are those of §1: v0≥0v_0 \ge 0v0​≥0, vi0≥0v_{i0} \ge 0vi0​≥0, revenues ordered ri1≥⋯≥rinr_{i1} \ge \dots \ge r_{in}ri1​≥⋯≥rin​, together with the disclosed pins vij>0v_{ij} > 0vij​>0 (the page allows zero-weight padding products, under which Proposition 2 of the paper fails), rij≥0r_{ij} \ge 0rij​≥0 (revenues are prices) and γi>0\gamma_i > 0γi​>0 (the page has γi≥0\gamma_i \ge 0γi​≥0; its convention Vi(∅)γi=0V_i(\emptyset)^{\gamma_i} = 0Vi​(∅)γi​=0 when vi0=0v_{i0} = 0vi0​=0 fails at γi=0\gamma_i = 0γi​=0).

Preamble
import Mathlib
import Definitions.Def_NestedLogitVariants_LP_Model
Formal statement
namespace NestedLogitVariants.LP

/-- §2, p. 12: at an optimal solution `(x̂, ŷ)` of (4), the first constraint binds with the
maximizers `Ŝ_i` of (5): `v_0 x̂ = ∑_i V_i(Ŝ_i)^{γ_i} (R_i(Ŝ_i) − x̂)`, and hence
`x̂ = Π(Ŝ_1, …, Ŝ_m)`. Pinned `0 < v_0` (the step "solving for x̂" divides by
`v_0 + ∑_i V_i(Ŝ_i)^{γ_i}`, which can vanish when `v_0 = 0`). -/
theorem lp4_opt_binding {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n)
    (hI : I.Standing) (hv0 : 0 < I.v0)
    (A : ι → Set (Finset (Fin n))) (xh : ℝ) (yh : ι → ℝ) (hopt : LP4Optimal I A xh yh)
    (Sh : ι → Finset (Fin n)) (hSmem : ∀ i, Sh i ∈ A i)
    (hSmax : ∀ i, ∀ S ∈ A i,
      nestWeight I i S * (R I i S - xh) ≤ nestWeight I i (Sh i) * (R I i (Sh i) - xh)) :
    I.v0 * xh = ∑ i, nestWeight I i (Sh i) * (R I i (Sh i) - xh) ∧ xh = revenue I Sh := by sorry

end NestedLogitVariants.LP
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. 12, §2, paragraph "We will now argue that the constraint above must be satisfied as equality …"
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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