Proposition 2: which extreme service duration is optimal for each product
ProvedPriceQualityService.Joint.proposition_2Assume for every product and . For each product define the duration by:
- if : when , and otherwise;
- if : when , and otherwise.
Then is an optimal duration vector for the joint problem (4): there are prices and qualities such that
for all prices , all qualities and all durations . Moreover, when , every optimal solution of (4) has for every product whose case is strict: and , or and .
The proposition tells the firm which products receive the shortest and which the longest service, using only each product's own parameters.
Formalization Note At the threshold both endpoints are optimal; the statement says that the paper's choice is an optimal duration, and that it is the only optimal duration of product outside the tie cases (threshold equality when ; when ) and when . is the paper's convex production cost (p. 8). Qualities range over .
import Mathlib import Definitions.Def_PriceQualityService_Joint_Model
namespace PriceQualityService.Joint
/-- Proposition 2, p. 11: choose for each product `i` the duration
`t*_i = t_s` if `b_i ≠ 0` and `(2(a_i − s_i)c_i − α_i b_i)/b_i² ≥ (t_s + t_l)/2`, or if `b_i = 0` and
`a_i > s_i`; and `t*_i = t_l` otherwise. Then `t*` is an optimal duration vector of problem (4): for
some prices `p` and qualities `q`, `(p, q, t*)` maximizes the profit (3) over all prices, all
qualities and all durations in `[t_s, t_l]^N`. Moreover, when `t_s < t_l`, every optimal solution
`(p, q, t)` of (4) has `t_i = t*_i` for every product `i` whose case is strict (`b_i ≠ 0` and
`(2(a_i − s_i)c_i − α_i b_i)/b_i² ≠ (t_s + t_l)/2`, or `b_i = 0` and `a_i ≠ s_i`); in the tie cases both
endpoints are optimal, so the page's "the optimal service duration" is read as "an optimal
duration", and as "the only optimal duration" outside the ties. -/
theorem proposition_2 {N : ℕ} (α a b c s : Fin N → ℝ) (hc : ∀ i, 0 < c i) (ts tl : ℝ)
(hst : ts ≤ tl) :
let tstar : Fin N → ℝ := fun i =>
if b i ≠ 0 then
(if (2 * (a i - s i) * c i - α i * b i) / b i ^ 2 ≥ (ts + tl) / 2 then ts else tl)
else (if a i > s i then ts else tl)
(∃ p q : Fin N → ℝ, ∀ 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 tstar) ∧
(ts < tl → ∀ 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, ((b i ≠ 0 ∧ (2 * (a i - s i) * c i - α i * b i) / b i ^ 2 ≠ (ts + tl) / 2) ∨
(b i = 0 ∧ a i ≠ s i)) →
t i = tstar i) := by sorry
end PriceQualityService.Joint
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.