Theorem 4.2, p. 16 — revenue-ordered assortments are optimal: S*_t(x) = {i : rᵢ > J_t(x) − J_{t+1}(x − 1)}
ProvedRobustMNL.Dynamic.revenue_ordered_optimalassortment-optimizationdynamic-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management
In the robust capacity-allocation model, let and . An assortment is , an optimal assortment of smallest cardinality of the period- Bellman problem with capacity , if and only if
The optimal dynamic assortment consists of the products whose revenue exceeds the opportunity cost 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 " is read as : at the Bellman equation does not apply ( is a boundary condition) and 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.