Theorem 4.1, p. 16, first inequality — ΔJ_t(x + 1) ≤ ΔJ_t(x): the value function is concave in capacity
ProvedRobustMNL.Dynamic.marginalValue_antitone_capacitydynamic-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management
In the robust capacity-allocation model, for every period and every capacity level ,
where is the marginal value of capacity. Equivalently, is concave on .
Concavity in capacity is the first half of Theorem 4.1, and gives the nonnegative increment used in Theorem 4.3.
Formalization Note The paper states the theorem "for any "; at the term is undefined, so the statement is made for . is defined for all (the recursion does not use ), so the statement for all contains the paper's for every . Revenues are arbitrary reals.
Preamble
import Mathlib import Definitions.Def_RobustMNL_Dynamic_ValueFunction
Formal statement
namespace RobustMNL.Dynamic
theorem marginalValue_antitone_capacity {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 (x + 1) ≤ 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 (first inequality), p. 16; proof in Appendix A, pp. 30–32
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.