Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(8), p. 15 — the objective of problem (7) is linear: Vi(S)(Ri(S)−u)=∑j∈Svij(rij−u)V_i(S)(R_i(S)-u)=\sum_{j\in S} v_{ij}(r_{ij}-u)Vi​(S)(Ri​(S)−u)=∑j∈S​vij​(rij​−u)

Proved
ConstrNestedLogit.Card.eq_8

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

assortment-optimizationnested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let iii be a nest of a nested logit instance in which a customer who chooses the nest always buys (no within-nest no-purchase weight), so that Vi(S)=∑j∈SvijV_i(S) = \sum_{j \in S} v_{ij}Vi​(S)=∑j∈S​vij​, and let the preference weights vijv_{ij}vij​ of the nest be positive. Let Ri(S)=∑j∈Svijrij/Vi(S)R_i(S) = \sum_{j\in S} v_{ij} r_{ij} / V_i(S)Ri​(S)=∑j∈S​vij​rij​/Vi​(S), with Ri(∅)=0R_i(\emptyset) = 0Ri​(∅)=0. Then for every assortment S⊆NS \subseteq NS⊆N and every u∈Ru \in \mathbb{R}u∈R,

Vi(S) (Ri(S)−u)=∑j∈Svij (rij−u).V_i(S)\,\bigl(R_i(S) - u\bigr) = \sum_{j \in S} v_{ij}\,(r_{ij} - u).Vi​(S)(Ri​(S)−u)=j∈S∑​vij​(rij​−u).

This is the identity that makes problem (7) linear in the assortment, and it turns (7) under cardinality constraints into the unit-weight knapsack problem (9).

Formalization Note The published V includes a within-nest no-purchase weight vnp i, set to 000 here, which is the paper's main model. Positivity of the vijv_{ij}vij​ is not restated on the page but is part of the model (vij=euˉij/γiv_{ij} = e^{\bar u_{ij}/\gamma_i}vij​=euˉij​/γi​, p. 10); it guarantees Vi(S)≠0V_i(S) \neq 0Vi​(S)=0 for S≠∅S \ne \emptysetS=∅. The case S=∅S = \emptysetS=∅ holds through Ri(∅)=0R_i(\emptyset) = 0Ri​(∅)=0. The identity is stated for every real uuu; the paper uses it for u≥0u \ge 0u≥0.

Preamble
import Mathlib
import Definitions.Def_NestedLogitVariants_LP_Model

open NestedLogitVariants.LP
Formal statement
namespace ConstrNestedLogit.Card

/-- Equation (8) (p. 15): with no within-nest no-purchase weight (`v_i0 = 0`, so
`V_i(S) = ∑_{j ∈ S} v_ij`) and positive preference weights, the objective of problem (7) is linear
in the assortment: `V_i(S)(R_i(S) − u) = ∑_{j ∈ S} v_ij (r_ij − u)`, including `S = ∅`. -/
theorem eq_8 {ι : Type*} {n : ℕ} (I : Instance ι n) (i : ι)
    (hvnp : I.vnp i = 0) (hv : ∀ j, 0 < I.v i j) (S : Finset (Fin n)) (u : ℝ) :
    V I i S * (R I i S - u) = ∑ j ∈ S, I.v i j * (I.r i j - u) := by sorry

end ConstrNestedLogit.Card
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. 15, eq. (8)
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