Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 11.6, lower bound (routing part): zT≤z∗z_T \le z^*zT​≤z∗

Proved
SupplyChainTheory.vrp_tsp_le

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

lower-boundsoperations-researchtraveling-salesmanvehicle-routing

For a unit-demand VRP instance with metric distances, zT≤z∗z_T \le z^*zT​≤z∗: the optimal TSP tour through the depot and all customers is no longer than the optimal VRP solution. Concatenating the routes of a VRP solution gives a closed walk through all nodes that visits the depot once per route; shortcutting the repeated depot visits, by the triangle inequality, yields a tour no longer than the solution. As C→∞C \to \inftyC→∞ this bound and the upper bound of Theorem 11.6 both approach zTz_TzT​.

Preamble
import Definitions.Def_SupplyChainTheory_vrp
Formal statement
namespace SupplyChainTheory

theorem vrp_tsp_le {n : ℕ} (c : Fin (n + 1) → Fin (n + 1) → ℝ) (hc : VRPMetric c)
    (hn : 1 ≤ n) (C : ℕ) (hC : 1 ≤ C) : tspOpt c ≤ vrpOpt c 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, p. 495, Sect. 11.4.1, the proof of Theorem 11.6 ('Moreover, by the triangle inequality, zT ≤ z∗')
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