Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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)

Disproved
RevenueManagement.dynamic_optimal_controls

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

bid-pricesbooking-limitsoperations-researchprotection-levelsrevenue-management

For the dynamic model (2.17) with an arrival model, prices p1≥⋯≥pn≥0p_1 \ge \dots \ge p_n \ge 0p1​≥⋯≥pn​≥0, capacity CCC and a period 1≤t≤T1 \le t \le T1≤t≤T: the time-dependent protection levels are nested, yj∗(t)≤yj+1∗(t)y_j^*(t) \le y_{j+1}^*(t)yj∗​(t)≤yj+1∗​(t); and for a class-jjj request (1≤j≤n1 \le j \le n1≤j≤n) with 1≤x≤C1 \le x \le C1≤x≤C units remaining, each of the following accept/reject decisions maximizes (pj−ΔVt+1(x)) u(p_j - \Delta V_{t+1}(x))\,u(pj​−ΔVt+1​(x))u over u∈{0,1}u \in \{0, 1\}u∈{0,1}: (i) accept iff x>yj−1∗(t)x > y_{j-1}^*(t)x>yj−1∗​(t), the protection levels (2.19); (ii) accept iff C−x<bj∗(t)C - x < b_j^*(t)C−x<bj∗​(t), the booking limits (2.20); (iii) accept iff pj≥πt+1(x)p_j \ge \pi_{t+1}(x)pj​≥πt+1​(x), 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.

Preamble
import Definitions.Def_RevenueManagement_singleResource
Formal statement
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
Source
Kalyan T. Talluri and Garrett J. van Ryzin, The Theory and Practice of Revenue Management, Kluwer/Springer 2004, DOI 10.1007/b139000, pp. 59-61, Theorem 2.2 with Eq. (2.18)-(2.20) and the acceptance rule p_j ≥ ΔV_{t+1}(x) of Sect. 2.5.2
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me