Proposition 4.2: if qₜ(p(t) − p(t+1)) + (1 − qₜ)(p(t) − r(t)) ≥ 0, the greatest optimal overbooking limits decline with time, x*(1) ≥ x*(2) ≥ ··· ≥ x*(T)
ProvedRevenueManagement.overbooking_limits_declinemonotone-policiesoperations-researchoverbookingrevenue-management
In the dynamic overbooking model with a convex denied-service cost, if the survival probabilities, revenues and refunds satisfy for , then the greatest optimal overbooking limits decline with time: for every , in . The condition holds in particular when revenues decrease over time and refunds do not exceed the current price.
Preamble
import Definitions.Def_RevenueManagement_overbooking
Formal statement
namespace RevenueManagement
theorem overbooking_limits_decline (M : DynOverbooking) (hM : M.IsModel) (hc : IsConvexSeq M.c)
(hcond : ∀ t, 1 ≤ t → t < M.T →
0 ≤ M.q t * (M.p t - M.p (t + 1)) + (1 - M.q t) * (M.p t - M.r t))
(t : ℕ) (ht : 1 ≤ t) (htT : t < M.T) :
M.overbookingLimit (t + 1) ≤ M.overbookingLimit t := by sorry
end RevenueManagement
Source
Kalyan T. Talluri and Garrett J. van Ryzin, The Theory and Practice of Revenue Management, Kluwer/Springer 2004, DOI 10.1007/b139000, p. 153, Proposition 4.2 and its footnote
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.