Appendix, Proof of Proposition 8 — is concave in the capacity
ProvedPricingRM.DetHeuristic.detValue_concaveIn the -period model, suppose that for every period the revenue rate is concave on and the mean demand is convex on . Let and be optimal solutions of the deterministic problem (32)–(33) at capacities and , so that . Then for every ,
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 may be (infeasible) or (unbounded) for some capacities, so concavity is stated at capacities 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.
import Mathlib import Definitions.Def_PricingRM_DetHeuristic_PricingModel open MeasureTheory ProbabilityTheory open scoped ENNReal
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.