Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.3: an efficient set maximizing (2.27) is optimal for the choice-based model, and the largest optimal set in the efficient order is increasing in the remaining capacity x and in time t

Proved
RevenueManagement.choice_optimal_policy

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

discrete-choiceefficient-setsnested-policiesoperations-researchrevenue-management

In the choice-based model with a choice model, arrival probabilities λt∈[0,1]\lambda_t \in [0, 1]λt​∈[0,1] that are positive in every period 1≤t≤T1 \le t \le T1≤t≤T, and nonnegative prices:

(a) in every period ttt with x≥1x \ge 1x≥1 units remaining some efficient set SSS maximizes λt(R(S)−Q(S)ΔVt+1(x))\lambda_t (R(S) - Q(S)\Delta V_{t+1}(x))λt​(R(S)−Q(S)ΔVt+1​(x)) over all offer sets, and Vt(x)=λt(R(S)−Q(S)ΔVt+1(x))+Vt+1(x)V_t(x) = \lambda_t (R(S) - Q(S)\Delta V_{t+1}(x)) + V_{t+1}(x)Vt​(x)=λt​(R(S)−Q(S)ΔVt+1​(x))+Vt+1​(x);

(b) for fixed ttt and 1≤x≤x′1 \le x \le x'1≤x≤x′, every efficient optimal set at xxx is matched by an efficient optimal set at x′x'x′ with at least as large a purchase probability;

(c) for fixed x≥1x \ge 1x≥1 and 1≤t≤t′≤T1 \le t \le t' \le T1≤t≤t′≤T, every efficient optimal set in period ttt is matched by an efficient optimal set in period t′t't′ with at least as large a purchase probability.

Since the efficient sets are indexed in increasing order of QQQ, (b) and (c) say that the largest optimal index k∗k^*k∗ is nondecreasing in xxx and in ttt.

Preamble
import Definitions.Def_RevenueManagement_singleResource
Formal statement
namespace RevenueManagement

theorem choice_optimal_policy {n : ℕ} (lam : ℕ → ℝ) (P : Finset (Fin n) → Fin n → ℝ)
    (p : Fin n → ℝ) (T : ℕ) (hP : IsChoiceModel P) (hlam : ∀ t, 0 ≤ lam t ∧ lam t ≤ 1)
    (hpos : ∀ t, 1 ≤ t → t ≤ T → 0 < lam t) (hp : ∀ j, 0 ≤ p j) :
    (∀ t x, 1 ≤ t → t ≤ T → 1 ≤ x → ∃ S, IsEfficient P p S ∧ IsChoiceOptimal lam P p T t x S ∧
      choiceValue lam P p T t x = choiceObj lam P p T t x S + choiceValue lam P p T (t + 1) x) ∧
    (∀ t x x', 1 ≤ t → t ≤ T → 1 ≤ x → x ≤ x' → ∀ S, IsEfficient P p S →
      IsChoiceOptimal lam P p T t x S → ∃ S', IsEfficient P p S' ∧
        IsChoiceOptimal lam P p T t x' S' ∧ purchaseProb P S ≤ purchaseProb P S') ∧
    (∀ t t' x, 1 ≤ t → t ≤ t' → t' ≤ T → 1 ≤ x → ∀ S, IsEfficient P p S →
      IsChoiceOptimal lam P p T t x S → ∃ S', IsEfficient P p S' ∧
        IsChoiceOptimal lam P p T t' x S' ∧ purchaseProb P S ≤ purchaseProb P S') := 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. 69, Theorem 2.3 ('An optimal policy for (2.24) is to select a set k* from among the m efficient, ordered sets {Sk : k = 1, ..., m} that maximizes (2.27). Moreover, for a fixed t, the largest optimal index k* is increasing in the remaining capacity x, and for any fixed x, k* is increasing in time t')
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