Theorem 1, p. 494 — an optimal q* with q_i* = 0, q_i* = K_i, or ∇_{q_i}Π₂(q*; a) = 0
ProvedMitigateSupplyRisk.DualSourcing.theorem_1Consider the two-supplier random-capacity newsvendor with expected profit (Eq. (3)), and suppose that demand has a density and finite mean.
Then there is an optimal procurement vector , that is, with for every , such that for each supplier
The theorem has two parts: a maximizer exists, although the feasible set is unbounded, and each of its coordinates is at a boundary ( or the design capacity) or at a stationary point of the profit in that coordinate. It is the starting point for the first-order condition (6).
Formalization Note. The printed statement reads ""; there is no un-indexed in the paper, and it means the design capacity . The partial derivative is the derivative at of with replaced by , and the third alternative asserts that this derivative exists and equals . The density of demand is the paper's standing assumption of §3.1, expressed as absolute continuity of the demand law with respect to Lebesgue measure.
import Mathlib import Definitions.Def_MitigateSupplyRisk_DualSourcing_Model open MeasureTheory ProbabilityTheory
namespace MitigateSupplyRisk.DualSourcing
/-- Theorem 1 (Wang, Gilland, Tomlin 2010, p. 494): when demand has a density, there is an optimal
procurement vector `q*` (a maximizer of `Π₂(·; a)` over `q ≥ 0`) such that for each supplier
`i`, either `q*_i = 0`, or `q*_i = K_i`, or the partial derivative of `Π₂(·; a)` in `q_i`
exists at `q*` and equals `0`. -/
theorem theorem_1 (M : Model) (μ : Measure ℝ) [IsProbabilityMeasure μ]
(hμ0 : μ (Set.Iio 0) = 0) (hμint : Integrable id μ) (hμac : μ ≪ volume)
(a : Fin 2 → ℝ) :
∃ q, M.IsOptimal μ a q ∧
∀ i : Fin 2, q i = 0 ∨ q i = M.K i ∨
HasDerivAt (fun t => M.Pi2 μ (Function.update q i t) a) 0 (q i) := by sorry
end MitigateSupplyRisk.DualSourcing
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.