Theorem 2 — the products with form an optimal assortment
ProvedMarkovChainChoice.Assortment.dual_tight_set_optimalassortment-optimizationchoice-modelslp-dualityp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a Markov chain choice model on (with , , ) and revenues. Let be an optimal solution of
and define . Then is an optimal solution of the assortment problem:
where is the solution of the (Balance) equations for the offer set .
The assortment problem over offer sets is thereby solved by one linear program with variables, which makes it tractable.
Formalization Note. The theorem is stated for every optimal solution of (Dual) (the paper's "the optimal solution"; the proof uses only optimality). is defined by equality , and revenues carry no sign assumption.
Preamble
import Mathlib import Definitions.Def_MarkovChainChoice_Assortment_Model import Definitions.Def_MarkovChainChoice_Assortment_LinearPrograms
Formal statement
namespace MarkovChainChoice.Assortment
theorem dual_tight_set_optimal {n : ℕ} (M : Model n) (r v : Fin n → ℝ)
(hv : IsDualOptimal M r v) :
IsOptimalAssortment M r (Finset.univ.filter (fun j => v j = r j)) := by sorry
end MarkovChainChoice.Assortment
Source
Feldman, Topaloglu, Revenue Management Under the Markov Chain Choice Model, Oper. Res. 65(5), 2017, p. 1326, Theorem 2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.