Theorem 2 — the tight set of an optimal dual solution is an optimal assortment
ProvedMarkovChainChoice.SingleResource.dual_tight_set_optimalLet be a Markov chain choice model with the standing assumptions and let be arbitrary product revenues. Let be an optimal solution of the (Dual) linear program
and define . Then is an optimal solution of the (Assortment) problem:
The theorem reduces assortment optimization under the Markov chain choice model to a linear program. In the single-resource problem it is applied in each period with the adjusted revenues , which may be negative.
Formalization Note The statement holds for every optimal (the paper speaks of "the" optimal solution; no uniqueness is assumed). No sign condition is placed on . This is the goal theorem of the companion mission I of this series, restated here because draft items cannot import one another.
import Mathlib import Definitions.Def_MarkovChainChoice_SingleResource_Assortment open MarkovChainChoice.Shared
namespace MarkovChainChoice.SingleResource
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.SingleResource
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.