Theorem 4.1, p. 16, second inequality — ΔJ_{t+1}(x) ≤ ΔJ_t(x): the marginal value of capacity decreases over time
ProvedRobustMNL.Dynamic.marginalValue_antitone_timedynamic-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management
In the robust capacity-allocation model, for every period and every capacity level ,
At , where , this says is nondecreasing in capacity.
The second half of Theorem 4.1: as the horizon runs out, a unit of capacity is worth less. It gives the nonnegative increment used in the second part of Theorem 4.3.
Formalization Note As for the first inequality, is excluded (the paper's "" includes an undefined ) and has no upper bound. Revenues are arbitrary reals.
Preamble
import Mathlib import Definitions.Def_RobustMNL_Dynamic_ValueFunction
Formal statement
namespace RobustMNL.Dynamic
theorem marginalValue_antitone_time {n : ℕ} (T : ℕ) (V : ℕ → Set (ℝ × (Fin n → ℝ)))
(r : Fin n → ℝ) (hV : IsUncertaintySeq T V) (t x : ℕ) (ht : 1 ≤ t) (htT : t ≤ T) (hx : 1 ≤ x) :
marginalValue T V r (t + 1) x ≤ marginalValue T V r t x := 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.1 (second inequality), p. 16; proof in Appendix A, p. 32
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.