(22), Appendix A.1, Case 1.b, p. 42 — the inequality with 1 ∨ α²_ik
ProvedNestedLogitVariants.Synergistic.ineq_22assortment-optimizationnested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management
Let be an optimal solution of (4) over the nested-by-revenue assortments for an instance with fully-captured nests and positive revenues. Fix a nest , an index with and , write , , and
Then
Together with (20) this gives the bound (23) with coefficient .
Formalization Note The standing assumptions are those of the model (see the Model definition) and of §4: every nest is fully captured, , and for some nest (p. 16). The positive revenues are the disclosed pin of this mission: they keep every denominator , , of (6) positive. Product of the page (indexed from ) is ⟨k - 1, _⟩ : Fin n; and are the sums over .
Preamble
import Mathlib import Definitions.Def_NestedLogitVariants_Synergistic_Relaxation
Formal statement
namespace NestedLogitVariants.Synergistic
/-- Inequality (22), Appendix A.1, Case 1.b, p. 42: for `2 ≤ k ≤ n` and `ρ ∈ [0, 1]`, with
`α²_{ik} = (R_i(N_{ik}) / R_i(N_{i,k−1})) (V_i(N_{ik})^{γ_i} / V_i(N_{i,k−1})^{γ_i})` and `a ∨ b = max {a, b}`,
`(1 ∨ α²_{ik}) ŷ_i ≥ (q_{i,k−1} + v_{ik} ρ)^{γ_i} [(R_{i,k−1} + r_{ik} v_{ik} ρ)/(q_{i,k−1} + v_{ik} ρ) − (1 ∨ α²_{ik}) x̂]`.
Product `k` (1-based) is `⟨k - 1, _⟩ : Fin n`. -/
theorem ineq_22 {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n)
(hI : I.Standing) (hfc : ∀ i, I.vnp i = 0) (hsyn : ∃ i, 1 < I.γ i)
(hr : ∀ i j, 0 < I.r i j)
(xh : ℝ) (yh : ι → ℝ) (hopt : LP4Optimal I (fun _ => {S | ∃ j ≤ n, S = nbr n j}) xh yh)
(i : ι) (k : ℕ) (hk2 : 2 ≤ k) (hkn : k ≤ n) (ρ : ℝ) (hρ : ρ ∈ Set.Icc (0 : ℝ) 1) :
max 1 (R I i (nbr n k) / R I i (nbr n (k - 1)) * (nestWeight I i (nbr n k) / nestWeight I i (nbr n (k - 1)))) * yh i ≥
(qsum I i (k - 1) + I.v i ⟨k - 1, by omega⟩ * ρ) ^ I.γ i *
((Rsum I i (k - 1) + I.r i ⟨k - 1, by omega⟩ * I.v i ⟨k - 1, by omega⟩ * ρ) / (qsum I i (k - 1) + I.v i ⟨k - 1, by omega⟩ * ρ) -
max 1 (R I i (nbr n k) / R I i (nbr n (k - 1)) * (nestWeight I i (nbr n k) / nestWeight I i (nbr n (k - 1)))) * xh) := by sorry
end NestedLogitVariants.Synergistic
Source
Davis, Gallego, Topaloglu, Assortment optimization under variants of the nested logit model, revised manuscript of June 18, 2013 (published Oper. Res. 62(2), 2014, DOI 10.1287/opre.2014.1256), p. 42, Appendix A.1, Case 1.b, display (22)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.