Proposition 2.3: an inefficient offer set is never an optimal solution of the choice-based Bellman equation (2.24)
ProvedRevenueManagement.inefficient_never_optimaldiscrete-choiceefficient-setsoperations-researchrevenue-management
In the choice-based model with a choice model, arrival probabilities in and nonnegative prices, in any period with a positive arrival probability and units remaining, a set that is inefficient in the sense of Definition 2.1 does not maximize : some other set does strictly better.
Preamble
import Definitions.Def_RevenueManagement_singleResource
Formal statement
namespace RevenueManagement
theorem inefficient_never_optimal {n : ℕ} (lam : ℕ → ℝ) (P : Finset (Fin n) → Fin n → ℝ)
(p : Fin n → ℝ) (T : ℕ) (hP : IsChoiceModel P) (hlam : ∀ t, 0 ≤ lam t ∧ lam t ≤ 1)
(hp : ∀ j, 0 ≤ p j) (t x : ℕ) (ht : 1 ≤ t) (htT : t ≤ T) (hx : 1 ≤ x) (hpos : 0 < lam t)
(S : Finset (Fin n)) (hS : IsInefficient P p S) :
¬ IsChoiceOptimal lam P p T t x 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. 68, Proposition 2.3 (proof omitted in the book; the argument sketched after it uses ΔV_{t+1}(x) ≥ 0)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.