Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.2, p. 16 — revenue-ordered assortments are optimal: S*_t(x) = {i : rᵢ > J_t(x) − J_{t+1}(x − 1)}

Proved
RobustMNL.Dynamic.revenue_ordered_optimal

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

assortment-optimizationdynamic-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management

In the robust capacity-allocation model, let 1≤t≤T1 \le t \le T1≤t≤T and x≥1x \ge 1x≥1. An assortment SSS is St∗(x)S^*_t(x)St∗​(x), an optimal assortment of smallest cardinality of the period-ttt Bellman problem with capacity xxx, if and only if

S={ i∈A:ri>Jt(x)−Jt+1(x−1) }.S = \{\, i \in \mathcal A : r_i > J_t(x) - J_{t+1}(x-1) \,\}.S={i∈A:ri​>Jt​(x)−Jt+1​(x−1)}.

The optimal dynamic assortment consists of the products whose revenue exceeds the opportunity cost Jt(x)−Jt+1(x−1)J_t(x) - J_{t+1}(x-1)Jt​(x)−Jt+1​(x−1) of selling a unit now; in particular it is revenue-ordered, extending the known-parameter result of Talluri and van Ryzin (2004).

Formalization Note "For any xxx" is read as x≥1x \ge 1x≥1: at x=0x = 0x=0 the Bellman equation does not apply (Jt(0)=0J_t(0) = 0Jt​(0)=0 is a boundary condition) and Jt+1(x−1)J_{t+1}(x-1)Jt+1​(x−1) is undefined. The "↔" asserts both that every smallest optimal assortment is the threshold set and that the threshold set is one. Revenues are arbitrary reals.

Preamble
import Mathlib
import Definitions.Def_RobustMNL_Dynamic_ValueFunction
Formal statement
namespace RobustMNL.Dynamic

theorem revenue_ordered_optimal {n : ℕ} (T : ℕ) (V : ℕ → Set (ℝ × (Fin n → ℝ)))
    (r : Fin n → ℝ) (hV : IsUncertaintySeq T V) (t x : ℕ) (ht : 1 ≤ t) (htT : t ≤ T) (hx : 1 ≤ x)
    (S : Finset (Fin n)) :
    IsOptAssort T V r t x S ↔
      S = Finset.univ.filter (fun i => J T V r t x - J T V r (t + 1) (x - 1) < r i) := by sorry

end RobustMNL.Dynamic
Source
Rusmevichientong, Topaloglu, Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model, Operations Research (2012), doi:10.1287/opre.1120.1063, authors' manuscript of 20 Sep 2011, Theorem 4.2, p. 16
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me