Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

pp. 16–17 — the optimal solutions of (9) depend only on the ordering and signs of the utilities

Proved
ConstrNestedLogit.Card.knapsack_optimal_order_sign

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

assortment-optimizationknapsackp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix a nest iii, a cardinality limit ci∈Nc_i \in \mathbb{N}ci​∈N, and write fij(u)=vij(rij−u)f_{ij}(u) = v_{ij}(r_{ij}-u)fij​(u)=vij​(rij​−u) for the utility of product jjj in problem (9). Let u,u′∈Ru, u' \in \mathbb{R}u,u′∈R be two values at which the utilities have

  1. the same ordering: for all products j,kj, kj,k, fij(u)≤fik(u)f_{ij}(u) \le f_{ik}(u)fij​(u)≤fik​(u) if and only if fij(u′)≤fik(u′)f_{ij}(u') \le f_{ik}(u')fij​(u′)≤fik​(u′);
  2. the same signs: for every product jjj, fij(u)f_{ij}(u)fij​(u) and fij(u′)f_{ij}(u')fij​(u′) are both positive, both zero, or both negative (the same position relative to the line fi0=0f_{i0} = 0fi0​=0).

Then for every assortment S⊆NS \subseteq NS⊆N,

S is optimal for (9) at u  ⟺  S is optimal for (9) at u′.S \text{ is optimal for (9) at } u \iff S \text{ is optimal for (9) at } u'.S is optimal for (9) at u⟺S is optimal for (9) at u′.

Applied to two values in one of the intervals between consecutive intersection points of the lines {fij:j∈N∪{0}}\{f_{ij} : j \in N \cup \{0\}\}{fij​:j∈N∪{0}}, this says that the optimal solution of (9) does not change inside such an interval.

Formalization Note The ordering is compared as a weak order, so ties are allowed, and the conclusion is about the whole set of optimal solutions, not about one selected solution. The signs are compared with Mathlib's SignType.sign.

Preamble
import Mathlib
import Definitions.Def_NestedLogitVariants_LP_Model
import Definitions.Def_ConstrNestedLogit_Card_Knapsack

open NestedLogitVariants.LP
Formal statement
namespace ConstrNestedLogit.Card

/-- The optimal solutions of the knapsack problem (9) depend only on the ordering and signs of
the utilities (pp. 16–17): if at `u` and `u'` the utilities `{f_ij : j ∈ N}` are ordered the
same way (as a weak order, ties included) and have the same signs (comparison with
`f_i0 = 0`), then `S` is optimal for (9) at `u` if and only if it is optimal at `u'`. -/
theorem knapsack_optimal_order_sign {ι : Type*} {n : ℕ} (I : Instance ι n) (c : ι → ℕ) (i : ι)
    (u u' : ℝ)
    (horder : ∀ j k : Fin n, utility I i j u ≤ utility I i k u ↔ utility I i j u' ≤ utility I i k u')
    (hsign : ∀ j : Fin n, SignType.sign (utility I i j u) = SignType.sign (utility I i j u'))
    (S : Finset (Fin n)) :
    IsKnapsackOptimal I c i u S ↔ IsKnapsackOptimal I c i u' S := 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, pp. 16–17, discussion of problem (9) and Figure 1
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