A.6, p. 54 — δ^γ̄ δ^(−[γ_i−1]^+) δ^(−[1−γ_i]^+) ≥ 1 and δ^(γ̄+γ_i+1) ≤ δ^(2γ̄+1)
ProvedNestedLogitVariants.PowersDelta.exponent_ge_oneapproximation-algorithmsassortment-optimizationnested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let , and . Then
where .
Applied with and , these two inequalities remove the extra powers of in the last step of the nonempty case of the proof of Theorem 12; the first is where the standing assumption of §6 is used.
Formalization Note All powers are real powers.
Preamble
import Mathlib
Formal statement
namespace NestedLogitVariants.PowersDelta
/-- A.6, p. 54: for `δ > 1`, `0 < γ ≤ γ̄` and `γ̄ > 1`,
`δ^{γ̄} δ^{−[γ−1]^+} δ^{−[1−γ]^+} ≥ 1` and `δ^{γ̄+γ+1} ≤ δ^{2γ̄+1}`. -/
theorem exponent_ge_one (δ γ γbar : ℝ) (hδ : 1 < δ) (hγ : 0 < γ) (hγle : γ ≤ γbar)
(hγbar1 : 1 < γbar) :
1 ≤ δ ^ γbar * δ ^ (-max (γ - 1) 0) * δ ^ (-max (1 - γ) 0) ∧
δ ^ (γbar + γ + 1) ≤ δ ^ (2 * γbar + 1) := by sorry
end NestedLogitVariants.PowersDelta
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. 54, Appendix A.6, the exponent argument
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.