§4.2, p. 20 — every feasible solution of problem (7) is feasible for problem (3)
ProvedNestedLogitVariants.Synergistic.lp7_feasible_lp3assortment-optimizationnested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management
Consider an instance of the nested logit assortment problem with fully-captured nests, for every nest . If is feasible for problem (7), that is,
then is feasible for problem (3):
Problem (3) is thus a relaxation of problem (7); feasibility for (7) is what the proof of Theorem 7 establishes.
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 hypothesis for some is not used by this statement but is kept as the section's standing assumption.
Preamble
import Mathlib import Definitions.Def_NestedLogitVariants_Synergistic_Relaxation
Formal statement
namespace NestedLogitVariants.Synergistic
/-- §4.2, p. 20: problem (3) is a relaxation of problem (7); every feasible solution `(x, y)` of (7)
is feasible for (3). (Fully-captured nests, `v_{i0} = 0`, as throughout §4.) -/
theorem lp7_feasible_lp3 {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n)
(hI : I.Standing) (hfc : ∀ i, I.vnp i = 0) (hsyn : ∃ i, 1 < I.γ i) :
∀ x (y : ι → ℝ), LP7Feasible I x y → LP3Feasible I x y := 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. 20, §4.2 (paragraph after display (7))
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.