§8.1, PDF p. 28 (Wang 2012) — the single-store problem (14) has optimal value θ*, attained by the full set at prices θ* + 1/βₖ
ProvedMultiStoreAssort.Pricing.single_store_optimumassortment-optimizationjoint-pricingmultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and , and let solve with . Consider the single-store joint assortment and pricing problem (14) under the MNL model,
Then:
- for every assortment and every real price vector , the objective of (14) is at most ;
- the full product set with the constant adjusted markup prices attains .
So offering every product at the prices is optimal for (14), and its optimal value is . 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 , 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.