Theorem 1: optimal durations are extreme, qualities are , markups equal , and is the optimal profit
ProvedPriceQualityService.Joint.theorem_1Consider the joint optimization problem (4): choose prices , quality levels and service durations to maximize the MNL profit
Assume for every and . Then:
- Existence and structure. There are durations with for every (part (a)) and a real number that is the unique solution of
such that with
(parts (b) and (c)) the triple is optimal for (4) and its profit equals . 2. Every optimum has this structure. If is optimal for (4) with optimal profit , then for every : , , solves the equation above with in place of , and, when , for every product with or .
Thus the optimal service durations are extreme, each quality is set from the product's own parameters, all products carry the same markup , and is the optimal profit.
Formalization Note is the paper's increasing convex production cost (p. 8). Qualities range over all of , as in the paper's proof; the model's range (p. 8) is not imposed. The paper's "always at a boundary point" is stated for optimal solutions in the precise form: when and the profit does not depend on once and are optimal, so every duration of product is optimal; for all other products every optimal duration is or (this needs ; when the claim is trivial). Products are Fin N (0-based) and is allowed (then ).
import Mathlib import Definitions.Def_PriceQualityService_Joint_Model
namespace PriceQualityService.Joint
/-- Theorem 1, Wang, Ke & Cui, pp. 9–10, for problem (4): maximize the profit (3) over prices
`p ∈ ℝ^N`, qualities `q ∈ ℝ^N` and service durations `t ∈ [t_s, t_l]^N`.
First conjunct (existence, (a)–(c)): there are durations `t*` with every `t*_i ∈ {t_s, t_l}` and a
real `r*` that is the unique root of
`r = ∑_i exp(b_i² t*_i²/(4c_i) + (s_i − a_i + α_i b_i/(2c_i)) t*_i + α_i²/(4c_i) − r − 1)`, such that
with `q*_i = (α_i + t*_i b_i)/(2c_i)` and `p*_i = 1 + r* + c_i q*_i² + t*_i(a_i − b_i q*_i)` the triple
`(p*, q*, t*)` is optimal and its profit is `r*`.
Second conjunct (every optimum has this structure): if `(p, q, t)` is optimal with value
`r* = Π(p, q, t)`, then `q_i = (α_i + t_i b_i)/(2c_i)`, `p_i = 1 + r* + c_i q_i² + t_i(a_i − b_i q_i)`,
`r*` solves the equation above at `t`, and, when `t_s < t_l`, `t_i ∈ {t_s, t_l}` for every `i` with
`b_i ≠ 0` or `a_i ≠ s_i` (when `b_i = 0` and `a_i = s_i` every duration of product `i` is optimal). -/
theorem theorem_1 {N : ℕ} (α a b c s : Fin N → ℝ) (hc : ∀ i, 0 < c i) (ts tl : ℝ)
(hst : ts ≤ tl) :
(∃ (tstar : Fin N → ℝ) (rstar : ℝ),
(∀ i, tstar i = ts ∨ tstar i = tl) ∧
rstar = ∑ i, Real.exp (durationExponent α a b c s i (tstar i) - rstar - 1) ∧
(∀ r : ℝ, r = ∑ i, Real.exp (durationExponent α a b c s i (tstar i) - r - 1) → r = rstar) ∧
(let qstar : Fin N → ℝ := fun i => (α i + tstar i * b i) / (2 * c i)
let pstar : Fin N → ℝ := fun i =>
1 + rstar + c i * qstar i ^ 2 + tstar i * (a i - b i * qstar i)
(∀ p q t : Fin N → ℝ, (∀ i, t i ∈ Set.Icc ts tl) →
profit α a b c s p q t ≤ profit α a b c s pstar qstar tstar) ∧
profit α a b c s pstar qstar tstar = rstar)) ∧
(∀ p q t : Fin N → ℝ, (∀ i, t i ∈ Set.Icc ts tl) →
(∀ p' q' t' : Fin N → ℝ, (∀ i, t' i ∈ Set.Icc ts tl) →
profit α a b c s p' q' t' ≤ profit α a b c s p q t) →
(∀ i, q i = (α i + t i * b i) / (2 * c i)) ∧
(∀ i, p i = 1 + profit α a b c s p q t + c i * q i ^ 2 + t i * (a i - b i * q i)) ∧
profit α a b c s p q t =
∑ i, Real.exp (durationExponent α a b c s i (t i) - profit α a b c s p q t - 1) ∧
(ts < tl → ∀ i, (b i ≠ 0 ∨ a i ≠ s i) → t i = ts ∨ t i = tl)) := by sorry
end PriceQualityService.Joint
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.