Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 11 — problem (2) is equivalent to the linear program (3): its optimal value is Z*

Proved
NestedLogitVariants.LP.lp3_value_eq

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

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

Consider an instance of the nested logit assortment problem with at least one nest and at least one product, and let (S1∗,…,Sm∗)(S_1^*, \dots, S_m^*)(S1∗​,…,Sm∗​) be an optimal assortment of problem (2), so Z∗=Π(S1∗,…,Sm∗)Z^* = \Pi(S_1^*, \dots, S_m^*)Z∗=Π(S1∗​,…,Sm∗​). Then Z∗Z^*Z∗ is the optimal value of the linear program (3):

Z∗=min⁡{x  :  ∃ y, v0x≥∑i∈Myi,  yi≥Vi(Si)γi(Ri(Si)−x)  ∀Si⊆N, i∈M},Z^* = \min\Big\{ x \;:\; \exists\, y,\ v_0 x \ge \sum_{i\in M} y_i,\ \ y_i \ge V_i(S_i)^{\gamma_i}(R_i(S_i) - x)\ \ \forall S_i \subseteq N,\ i \in M \Big\},Z∗=min{x:∃y, v0​x≥i∈M∑​yi​,  yi​≥Vi​(Si​)γi​(Ri​(Si​)−x)  ∀Si​⊆N, i∈M},

that is, Z∗Z^*Z∗ is feasible for (3) with a suitable yyy, and every feasible xxx is at least Z∗Z^*Z∗. No positivity of v0v_0v0​ is assumed; the paper notes that (3) continues to apply when v0=0v_0 = 0v0​=0.

This is the linear-programming representation on which the approximation framework of the paper rests.

Formalization Note The minimum is stated with IsLeast on the set of feasible xxx. At least one nest and one product are assumed: with no nests, or no products, and v0=vi0=0v_0 = v_{i0} = 0v0​=vi0​=0, every xxx is feasible for (3) and the claim fails, a degenerate instance the paper does not consider. 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. 11: problem (2) is equivalent to the linear program (3). If `S*` is an optimal
assortment, then `Z* = Π(S*)` is the least `x` for which some `y` makes `(x, y)` feasible for
(3), i.e. the optimal value of (3) is `Z*`. No positivity of `v_0` is assumed: the page states that
(3) "continues to apply when the preference weight `v_0` of the no purchase option is zero".
`Nonempty ι` and `0 < n` (at least one nest and one product) exclude the empty instance, in which
with `v_0 = 0` every `x` is feasible for (3). -/
theorem lp3_value_eq {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n)
    (hI : I.Standing) [Nonempty ι] (hn : 0 < n)
    (Sstar : ι → Finset (Fin n)) (hopt : IsOptimal I Sstar) :
    IsLeast {x | ∃ y, LP3Feasible I x y} (revenue I Sstar) := 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. 11, §2, the derivation of (3) ("Therefore, problem (2) is equivalent to … x* = Z*")
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