Proof of Proposition 3, ec12 — corrected upper district bound
ProvedCarlssonPartition.Approx.upper_boundheavy-trafficp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1region-partitioningvehicle-routing
Suppose is an equitable partition for both and , with , global workload below one, , and the corrected . Let and . For every district,
This is the upper half of the paper's two sided comparison of district and benchmark leading times.
Formalization Note The printed uses a maximum; this statement uses the minimum required by the proof. The stable regime and make the denominator positive. is the district's Theorem 3 expression, not an independently formalized queueing expectation.
Preamble
import Mathlib import Definitions.Def_CarlssonPartition_Approx_Setting
Formal statement
namespace CarlssonPartition.Approx
theorem upper_bound (I : Instance) (hI : I.Standing)
(Rs : Fin I.m → Set CarlssonPartition.Equitable.Plane) (hP : I.IsPartition Rs)
(lam ε : ℝ) (hlam : 0 < lam)
(hstab : I.workload I.m lam I.R I.f < 1)
(hε : 0 ≤ ε)
(h1 : ∀ i, |I.mu1 (Rs i) - (1 / (I.m : ℝ)) * I.mu1 I.R| ≤ ε)
(h2 : ∀ i, |I.mu2 (Rs i) - (1 / (I.m : ℝ)) * I.mu2 I.R| ≤ ε)
(hη : I.eta lam ε < 1) :
∀ i, I.bvrLeading 1 (I.lamSub lam (Rs i)) (Rs i) (I.fSub (Rs i)) ≤
I.bvrLeading I.m lam I.R I.f *
((1 + I.eta lam ε) / (1 - I.eta lam ε)) ^ 2 := by sorry
end CarlssonPartition.Approx
Source
Carlsson, Liu, Salari and Yu, Provably Good Region Partitioning for On-Time Last-Mile Delivery, accepted manuscript (SSRN 3915544; published in Operations Research 72(1):91–109, 2024, doi:10.1287/opre.2021.0588), proof of Proposition 3, p. ec12 (PDF 49), final display
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.