Theorem 2.2: the dynamic model is optimally controlled by time-dependent nested protection levels (2.19), booking limits (2.20), or bid-price tables (2.18)
DisprovedRevenueManagement.dynamic_optimal_controlsFor the dynamic model (2.17) with an arrival model, prices , capacity and a period : the time-dependent protection levels are nested, ; and for a class- request () with units remaining, each of the following accept/reject decisions maximizes over : (i) accept iff , the protection levels (2.19); (ii) accept iff , the booking limits (2.20); (iii) accept iff , the bid prices (2.18).
Retired. Retired because IsDynOptimal in Def_RevenueManagement_singleResource let the competitor decision u' range over all reals ≤ 1 (missing : ℕ), so u = 0 was never optimal when p_j < ΔV_{t+1}(x) (accepted disproof); replaced by RevenueManagement.dynamic_optimal_controls_v2 on Def_RevenueManagement_singleResource_v2.
import Definitions.Def_RevenueManagement_singleResource
namespace RevenueManagement
theorem dynamic_optimal_controls (lam : ℕ → ℕ → ℝ) (p : ℕ → ℝ) (n T C : ℕ)
(hlam : IsArrivalModel lam n) (hp : ∀ j, 0 ≤ p j) (hanti : Antitone p) (t : ℕ) (ht : 1 ≤ t)
(htT : t ≤ T) :
(∀ j, dynProtLevel lam p n T C t j ≤ dynProtLevel lam p n T C t (j + 1)) ∧
(∀ j x, 1 ≤ j → j ≤ n → 1 ≤ x → x ≤ C →
IsDynOptimal lam p n T t x j (if dynProtLevel lam p n T C t (j - 1) < x then 1 else 0)) ∧
(∀ j x, 1 ≤ j → j ≤ n → 1 ≤ x → x ≤ C →
IsDynOptimal lam p n T t x j (if C - x < dynBookLimit lam p n T C t j then 1 else 0)) ∧
(∀ j x, 1 ≤ j → j ≤ n → 1 ≤ x → x ≤ C →
IsDynOptimal lam p n T t x j (if dynBidPrice lam p n T (t + 1) x ≤ p j then 1 else 0)) := by sorry
end RevenueManagement
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.