Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 2 — the tight set {j:v^j=rj}\{j : \hat v_j = r_j\}{j:v^j​=rj​} of an optimal dual solution is an optimal assortment

Proved
MarkovChainChoice.SingleResource.dual_tight_set_optimal

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

assortment-optimizationchoice-modelsdualitylinear-programmingp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (λ,ρ)(\lambda,\rho)(λ,ρ) be a Markov chain choice model with the standing assumptions and let r∈Rnr\in\mathbb R^nr∈Rn be arbitrary product revenues. Let v^\hat vv^ be an optimal solution of the (Dual) linear program

min⁡v∈Rn{∑j∈Nλjvj:vj≥rj, vj≥∑i∈Nρj,ivi  ∀j∈N},\min_{v\in\mathbb R^n}\Big\{\sum_{j\in N}\lambda_j v_j : v_j\ge r_j,\ v_j\ge\sum_{i\in N}\rho_{j,i}v_i\ \ \forall j\in N\Big\},v∈Rnmin​{j∈N∑​λj​vj​:vj​≥rj​, vj​≥i∈N∑​ρj,i​vi​  ∀j∈N},

and define S^={j∈N:v^j=rj}\hat S=\{j\in N:\hat v_j=r_j\}S^={j∈N:v^j​=rj​}. Then S^\hat SS^ is an optimal solution of the (Assortment) problem:

∑j∈NPj,S rj ≤ ∑j∈NPj,S^ rjfor every S⊆N.\sum_{j\in N}P_{j,S}\,r_j\ \le\ \sum_{j\in N}P_{j,\hat S}\,r_j\qquad\text{for every } S\subseteq N.j∈N∑​Pj,S​rj​ ≤ j∈N∑​Pj,S^​rj​for every S⊆N.

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 rj−ΔVt+1(x)r_j-\Delta V_{t+1}(x)rj​−ΔVt+1​(x), which may be negative.

Formalization Note The statement holds for every optimal v^\hat vv^ (the paper speaks of "the" optimal solution; no uniqueness is assumed). No sign condition is placed on rrr. This is the goal theorem of the companion mission I of this series, restated here because draft items cannot import one another.

Preamble
import Mathlib
import Definitions.Def_MarkovChainChoice_SingleResource_Assortment
open MarkovChainChoice.Shared
Formal statement
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
Source
Feldman, Topaloglu, Revenue Management Under the Markov Chain Choice Model, Oper. Res. 65(5), 2017, p. 1326, Theorem 2
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me