Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Appendix, Proof of Proposition 8 — V1det⁡V_1^{\det}V1det​ is concave in the capacity

Proved
PricingRM.DetHeuristic.detValue_concave

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-optimizationp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management

In the NNN-period model, suppose that for every period nnn the revenue rate p↦p E[Dn(p)]p \mapsto p\,E[D_n(p)]p↦pE[Dn​(p)] is concave on [0,∞)[0,\infty)[0,∞) and the mean demand p↦E[Dn(p)]p \mapsto E[D_n(p)]p↦E[Dn​(p)] is convex on [0,∞)[0,\infty)[0,∞). Let p(1)p^{(1)}p(1) and p(2)p^{(2)}p(2) be optimal solutions of the deterministic problem (32)–(33) at capacities C1C_1C1​ and C2C_2C2​, so that V1det⁡(Ci)=∑npn(i)E[Dn(pn(i))]V_1^{\det}(C_i) = \sum_n p^{(i)}_n E[D_n(p^{(i)}_n)]V1det​(Ci​)=∑n​pn(i)​E[Dn​(pn(i)​)]. Then for every θ∈[0,1]\theta \in [0,1]θ∈[0,1],

θ V1det⁡(C1)+(1−θ) V1det⁡(C2)≤V1det⁡(θC1+(1−θ)C2).\theta\, V_1^{\det}(C_1) + (1-\theta)\, V_1^{\det}(C_2) \le V_1^{\det}\big(\theta C_1 + (1-\theta) C_2\big).θV1det​(C1​)+(1−θ)V1det​(C2​)≤V1det​(θC1​+(1−θ)C2​).

Concavity of the deterministic value in the capacity is the first step of the paper's proof of Proposition 8; it is what allows Jensen's inequality to be applied to the value of the remaining periods.

Formalization Note V1det⁡(C)V_1^{\det}(C)V1det​(C) may be −∞-\infty−∞ (infeasible) or +∞+\infty+∞ (unbounded) for some capacities, so concavity is stated at capacities C1,C2C_1, C_2C1​,C2​ where the problem has an optimal solution; the right-hand side is the EReal supremum detValue. "Concave objective and convex feasible region" is read as the two per-period hypotheses above, which make (33) convex for every capacity.

Preamble
import Mathlib
import Definitions.Def_PricingRM_DetHeuristic_PricingModel

open MeasureTheory ProbabilityTheory
open scoped ENNReal
Formal statement
namespace PricingRM.DetHeuristic

/-- Bitran–Caldentey (2003), Appendix, Proof of Proposition 8, first sentence, p. 226:
`V_1^det` is concave in the capacity. If `p₁` and `p₂` are optimal for (32)–(33) at capacities
`C₁` and `C₂` (so `V_1^det(Cᵢ)` is the objective of `pᵢ`), then for every `θ ∈ [0, 1]`,
`θ V_1^det(C₁) + (1 - θ) V_1^det(C₂) ≤ V_1^det(θ C₁ + (1 - θ) C₂)`. -/
theorem detValue_concave {N : ℕ} (M : PricingModel N)
    (hconc : ∀ n, ConcaveOn ℝ (Set.Ici 0) (fun p => p * meanDemand M n p))
    (hconv : ∀ n, ConvexOn ℝ (Set.Ici 0) (meanDemand M n))
    (C₁ C₂ : ℝ) (p₁ p₂ : Fin N → ℝ) (h₁ : IsDetOptimal M C₁ p₁) (h₂ : IsDetOptimal M C₂ p₂)
    (θ : ℝ) (hθ₀ : 0 ≤ θ) (hθ₁ : θ ≤ 1) :
    ((θ * detObjective M p₁ + (1 - θ) * detObjective M p₂ : ℝ) : EReal) ≤
      detValue M (θ * C₁ + (1 - θ) * C₂) := by sorry

end PricingRM.DetHeuristic
Source
Bitran and Caldentey, An Overview of Pricing Models for Revenue Management, MSOM 5(3) 2003, p. 226, Appendix, Proof of Proposition 8, first sentence
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me