Lemma 3 — lowering all revenues by shrinks the dual tight set
ProvedMarkovChainChoice.SingleResource.dual_tight_set_shrinksassortment-optimizationchoice-modelslinear-programmingp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a Markov chain choice model with the standing assumptions, arbitrary revenues and . Let be an optimal solution of (Dual) with revenues , and let be an optimal solution of (Dual) when the revenue of every product is decreased by , i.e. with revenues . Then
Combined with Theorem 2, this says that decreasing all revenues by the same nonnegative amount makes the optimal assortment produced by the dual smaller. This is the step that turns monotonicity of marginal values into nested offer sets in Theorem 5.
Formalization Note The paper writes for (non-strict) inclusion; it is rendered as . Both dual solutions are arbitrary optimal solutions. No sign condition is placed on .
Preamble
import Mathlib import Definitions.Def_MarkovChainChoice_SingleResource_Assortment open MarkovChainChoice.Shared
Formal statement
namespace MarkovChainChoice.SingleResource
theorem dual_tight_set_shrinks {n : ℕ} (M : Model n) (r : Fin n → ℝ) (η : ℝ) (hη : 0 ≤ η)
(v0 vη : Fin n → ℝ) (hv0 : IsDualOptimal M r v0)
(hvη : IsDualOptimal M (fun j => r j - η) vη) :
Finset.univ.filter (fun j => vη j = r j - η) ⊆
Finset.univ.filter (fun j => v0 j = r j) := by sorry
end MarkovChainChoice.SingleResource
Source
Feldman, Topaloglu, Revenue Management Under the Markov Chain Choice Model, Oper. Res. 65(5), 2017, p. 1327, Lemma 3
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.