Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 11.6 (Haimovich and Rinnooy Kan): max⁡{2nCcˉ,zT}≤z∗≤2⌈n/C⌉cˉ+(1−1C)zT\max\{2\frac{n}{C}\bar c, z_T\} \le z^* \le 2\lceil n/C\rceil\bar c + (1 - \frac{1}{C}) z_Tmax{2Cn​cˉ,zT​}≤z∗≤2⌈n/C⌉cˉ+(1−C1​)zT​

Proved
SupplyChainTheory.vrp_tsp_bounds

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

boundsoperations-researchtraveling-salesmanvehicle-routing

Theorem 11.6. For a VRP instance on nodes N={0,1,…,n}N = \{0, 1, \dots, n\}N={0,1,…,n} with metric distances, di=1d_i = 1di​=1 for every customer, vehicle capacity C≥1C \ge 1C≥1 and an unrestricted number of vehicles,

max⁡{2nCcˉ, zT}  ≤  z∗  ≤  2⌈nC⌉cˉ+(1−1C)zT,\max\Big\{2\frac{n}{C}\bar c,\ z_T\Big\} \;\le\; z^* \;\le\; 2\Big\lceil\frac{n}{C}\Big\rceil\bar c + \Big(1 - \frac{1}{C}\Big)z_T,max{2Cn​cˉ, zT​}≤z∗≤2⌈Cn​⌉cˉ+(1−C1​)zT​,

where z∗z^*z∗ is the optimal VRP objective, zTz_TzT​ the length of the optimal TSP tour through all the nodes, and cˉ=1n∑i=1nc0i\bar c = \frac{1}{n}\sum_{i=1}^n c_{0i}cˉ=n1​∑i=1n​c0i​ the average distance from the depot to the customers. The lower bound combines the radial bound on each route with zT≤z∗z_T \le z^*zT​≤z∗; the upper bound is the iterated optimal tour partition heuristic applied to the optimal tour, using ⌈n/C⌉/n≥1/C\lceil n/C\rceil/n \ge 1/C⌈n/C⌉/n≥1/C. Both bounds are tight (Problem 11.18); the first term of the upper bound is the radial distance to the customers and the second the local delivery distance, and as C→∞C \to \inftyC→∞ both bounds approach zTz_TzT​.

Preamble
import Definitions.Def_SupplyChainTheory_vrp
Formal statement
namespace SupplyChainTheory

theorem vrp_tsp_bounds {n : ℕ} (c : Fin (n + 1) → Fin (n + 1) → ℝ) (hc : VRPMetric c)
    (hn : 1 ≤ n) (C : ℕ) (hC : 1 ≤ C) :
    max (2 * ((n : ℝ) / C) * avgDepotDist c) (tspOpt c) ≤ vrpOpt c C
      ∧ vrpOpt c C ≤ 2 * ⌈(n : ℝ) / C⌉₊ * avgDepotDist c + (1 - 1 / (C : ℝ)) * tspOpt c := by sorry

end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, pp. 495-496, Sect. 11.4.1, Theorem 11.6, Eq. (11.57), and its proof; after Haimovich and Rinnooy Kan (1985)
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me