Revenue characterized by the balance equation
ProvedConstrNestedLogit.Stitch.revenue_characterizationassortment-optimizationnested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Fix an assortment and a real number . With , , , and as in the nested logit model, the balance equation holds exactly when equals the expected revenue . Its inequality form holds exactly when bounds that revenue from above:
The two relations express the algebraic conversion used in the proof of Lemma 1 to compare candidate combinations with the value solving equation (2).
Formalization Note This is the main model with , , positive product weights, and . The formulas include empty assortments, for which .
Preamble
import Mathlib import Definitions.Def_NestedLogitVariants_LP_Model
Formal statement
namespace ConstrNestedLogit.Stitch
/-- The algebraic equalities and inequality used in the proof of Lemma 1, pp. 11–12. -/
theorem revenue_characterization {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ}
(I : NestedLogitVariants.LP.Instance ι n)
(S : ι → Finset (Fin n)) (z : ℝ)
(hvnp : ∀ i, I.vnp i = 0)
(hv0 : 0 < I.v0)
(hv : ∀ i j, 0 < I.v i j)
(hγ : ∀ i, 0 < I.γ i ∧ I.γ i ≤ 1) :
(I.v0 * z = ∑ i, NestedLogitVariants.LP.nestWeight I i (S i) *
(NestedLogitVariants.LP.R I i (S i) - z) ↔
z = NestedLogitVariants.LP.revenue I S) ∧
(I.v0 * z ≥ ∑ i, NestedLogitVariants.LP.nestWeight I i (S i) *
(NestedLogitVariants.LP.R I i (S i) - z) ↔
NestedLogitVariants.LP.revenue I S ≤ z) := by sorry
end ConstrNestedLogit.Stitch
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. 11–12, proof of Lemma 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.