PDF p. 11 — a smallest revenue-ordered optimal assortment S̃ of the single-store problem (3) exists
ProvedMultiStoreAssort.SQR.stilde_existsassortment-optimizationmultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be product revenues and attraction values, with . Consider the single-store MNL assortment problem
At least one revenue-ordered assortment , , is optimal (Talluri and van Ryzin 2004). Consequently there is a smallest revenue-ordered optimal assortment : it is revenue-ordered, optimal, and has no more elements than any other revenue-ordered optimal assortment.
This sentence makes the paper's well defined; every result of the mission that mentions assumes it, so this statement shows that hypothesis can be met.
Formalization Note. Revenues are assumed positive (they are prices); is needed because revenue-ordered sets are nonempty.
Preamble
import Mathlib import Definitions.Def_MultiStoreAssort_SQR_Model
Formal statement
namespace MultiStoreAssort.SQR
theorem stilde_exists {n : ℕ} (r v : Fin n → ℝ) (hn : 0 < n) (hr : StrictAnti r)
(hrpos : ∀ k, 0 < r k) (hv : ∀ k, 0 < v k) :
∃ St : Finset (Fin n), MultiStoreAssort.SMR.IsStilde r v St := by sorry
end MultiStoreAssort.SQR
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. 11, §3, sentence after (3) (citing Talluri and van Ryzin 2004)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.