Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8.1, PDF p. 28 (Wang 2012) — the single-store problem (14) has optimal value θ*, attained by the full set at prices θ* + 1/βₖ

Proved
MultiStoreAssort.Pricing.single_store_optimum

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

assortment-optimizationjoint-pricingmultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let α1,…,αn>0\alpha_1,\dots,\alpha_n>0α1​,…,αn​>0 and β1,…,βn>0\beta_1,\dots,\beta_n>0β1​,…,βn​>0, and let θ∗\theta^*θ∗ solve θ∗=∑k∈Neα^k−βkθ∗\theta^*=\sum_{k\in\mathcal N}e^{\hat\alpha_k-\beta_k\theta^*}θ∗=∑k∈N​eα^k​−βk​θ∗ with α^k=αk−log⁡βk−1\hat\alpha_k=\alpha_k-\log\beta_k-1α^k​=αk​−logβk​−1. Consider the single-store joint assortment and pricing problem (14) under the MNL model,

max⁡S⊆N, (pk)∈Rn ∑k∈Spkexp⁡(αk−βkpk)1+∑k∈Sexp⁡(αk−βkpk).\max_{S\subseteq\mathcal N,\ (p_k)\in\mathbb R^n}\ \frac{\sum_{k\in S}p_k\exp(\alpha_k-\beta_kp_k)}{1+\sum_{k\in S}\exp(\alpha_k-\beta_kp_k)}.S⊆N, (pk​)∈Rnmax​ 1+∑k∈S​exp(αk​−βk​pk​)∑k∈S​pk​exp(αk​−βk​pk​)​.

Then:

  1. for every assortment S⊆NS\subseteq\mathcal NS⊆N and every real price vector (pk)(p_k)(pk​), the objective of (14) is at most θ∗\theta^*θ∗;
  2. the full product set S=NS=\mathcal NS=N with the constant adjusted markup prices pk=θ∗+1/βkp_k=\theta^*+1/\beta_kpk​=θ∗+1/βk​ attains θ∗\theta^*θ∗.

So offering every product at the prices θ∗+1/βk\theta^*+1/\beta_kθ∗+1/βk​ is optimal for (14), and its optimal value is θ∗\theta^*θ∗. This is the multi-product MNL pricing theorem with heterogeneous price sensitivities that the paper cites (see, e.g., Wang 2012); it is the single-store bound used in the proof of Theorem 6.

Formalization Note Prices range over all of R\mathbb RR, as on the page. The optimum is stated as a universal upper bound plus attainment, not through a supremum.

Preamble
import Mathlib
import Definitions.Def_MultiStoreAssort_Pricing_Model
Formal statement
namespace MultiStoreAssort.Pricing
open Finset

theorem single_store_optimum {n : ℕ} (a b : Fin n → ℝ) (ha : ∀ k, 0 < a k) (hb : ∀ k, 0 < b k)
    (θ : ℝ) (hθ : IsTheta a b θ) :
    (∀ (S : Finset (Fin n)) (p : Fin n → ℝ), rev14 a b S p ≤ θ) ∧
      rev14 a b Finset.univ (fun k => θ + 1 / b k) = θ := by sorry

end MultiStoreAssort.Pricing
Source
Liu, Chen, Liu & Wan, Simultaneous vs. Sequential: Optimal Assortment Recommendation in Multistore Retailing, authors' manuscript with Online and Additional Supplements (2024-09-17; MSOM DOI 10.1287/msom.2024.0761), PDF p. 28, (14) and the sentence after it; Online Supplement App. E.1, PDF p. 47 ("the constructed solution in Theorem 6 is exactly the optimal solution to problem (14) for each store (see, e.g., Wang 2012)")
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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