Section 7 — the step size is at most one on
ProvedMarkovChainChoice.DimReduction.drAlpha_le_onechoice-modelsp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedra
Let be a Markov chain choice model satisfying the standing assumptions, let , and suppose is nonempty. Then
Hence Step 2 of the Dimension Reduction algorithm either stops () or produces , so Step 3 is well defined.
Preamble
import Mathlib import Definitions.Def_MarkovChainChoice_Shared_Model import Definitions.Def_MarkovChainChoice_Shared_Balance import Definitions.Def_MarkovChainChoice_DimReduction_H import Definitions.Def_MarkovChainChoice_DimReduction_Algorithm open MarkovChainChoice.Shared
Formal statement
namespace MarkovChainChoice.DimReduction
theorem drAlpha_le_one {n : ℕ} (M : Model n) :
∀ p ∈ H M, (drSupp p.1).Nonempty → drAlpha M p.1 ≤ 1 := by sorry
end MarkovChainChoice.DimReduction
Source
Feldman, Topaloglu, Revenue Management Under the Markov Chain Choice Model, Oper. Res. 65(5), 2017, p. 1332, Section 7, right column
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.