Proposition 4.1: with a convex denied-service cost, an overbooking-limit policy is optimal in the dynamic overbooking model
ProvedRevenueManagement.overbooking_limit_policybooking-limitsdynamic-programmingoperations-researchoverbookingrevenue-management
In the dynamic overbooking model with a convex denied-service cost , in every period the overbooking-limit policy with the greatest optimal limit is optimal: with reservations on hand and new requests, booking , that is accepting new reservations until the total on hand reaches , attains the maximum of over . When the policy accepts every request.
Preamble
import Definitions.Def_RevenueManagement_overbooking
Formal statement
namespace RevenueManagement
theorem overbooking_limit_policy (M : DynOverbooking) (hM : M.IsModel) (hc : IsConvexSeq M.c)
(t : ℕ) (ht : 1 ≤ t) (htT : t ≤ M.T) (y d : ℕ) :
M.IsOptimalLevel t y d (limitPolicy (M.overbookingLimit t) y d) := 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.1 (the model is a simplification of Chatwin's, Sect. 4.3.1)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.