§4, p. 1345 — Q*_CC = F^{-1}((p + s − m)/(p + s − u)) is the unique optimal centralized production
ProvedTsayQF.NoCommit.cc_optimalConsider the supply chain of Tsay (1999) with costs , , , demand with independent of , and suppose the distribution function of is differentiable and strictly increasing and has finite variance. Let be the distribution function of and
the expected profit of a central planner producing before the demand signal. Then some solves
and a production maximizes over if and only if it solves this equation.
Since is strictly increasing, this is the unique centralized optimum , the efficiency benchmark against which the decentralized arrangements are measured.
Formalization Note is not a Lean function here: the statement gives existence of a solution and characterizes the maximizers by the equation. Productions range over all of ; the paper's presumption that demand is almost certainly nonnegative is not needed.
import Mathlib import Definitions.Def_TsayQF_NoCommit_Model open MeasureTheory ProbabilityTheory open scoped NNReal
namespace TsayQF.NoCommit
theorem cc_optimal (D : Data) (ν : Measure ℝ) [IsProbabilityMeasure ν]
(hΘ : StrictMono (cdf ν)) (hΘd : Differentiable ℝ (cdf ν)) (hν : MemLp id 2 ν)
(v : ℝ≥0) :
(∃ Q : ℝ, cdf (lawX ν v) Q = kS D) ∧
∀ Q : ℝ, IsMaxOn (ccProfit D ν v) Set.univ Q ↔ cdf (lawX ν v) Q = kS D := by sorry
end TsayQF.NoCommit
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.