(25), Appendix A.1, Case 2, p. 43 — α ŷ_i bounds the objective of (8) when only the first product is offered fractionally
ProvedNestedLogitVariants.Synergistic.ineq_25Let be an optimal solution of (4) over the nested-by-revenue assortments for an instance with fully-captured nests, positive revenues, and for some nest , and let be the expression in (6). For every nest and every ,
This is the case of the bound (24).
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 is ⟨0, _⟩ : Fin n. At the right side is . The condition is the range of (6). The number is given together with the hypothesis that it is the greatest element of the set of terms of (6).
import Mathlib import Definitions.Def_NestedLogitVariants_Synergistic_Factor
namespace NestedLogitVariants.Synergistic
/-- Inequality (25), Appendix A.1, Case 2, p. 43: for `ρ ∈ [0, 1]`, with `α` the expression in (6),
`α ŷ_i ≥ (v_{i1} ρ)^{γ_i} [r_{i1} v_{i1} ρ/(v_{i1} ρ) − α x̂]`. Product `1` is `⟨0, _⟩ : Fin n`. -/
theorem ineq_25 {ι : 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) (hn : 2 ≤ n)
(α : ℝ) (hα : IsGreatest (alphaTerms I) α)
(xh : ℝ) (yh : ι → ℝ) (hopt : LP4Optimal I (fun _ => {S | ∃ j ≤ n, S = nbr n j}) xh yh)
(i : ι) (ρ : ℝ) (hρ : ρ ∈ Set.Icc (0 : ℝ) 1) :
α * yh i ≥ (I.v i ⟨0, by omega⟩ * ρ) ^ I.γ i * (I.r i ⟨0, by omega⟩ * I.v i ⟨0, by omega⟩ * ρ / (I.v i ⟨0, by omega⟩ * ρ) - α * xh) := by sorry
end NestedLogitVariants.Synergistic
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.