Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Computational procedure, condition (III), p. 573 — the Table II test holds exactly when the runs can be allocated to trucks

Proved
ClarkeWright64.Savings.tableII_iff_fleetFeasible

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

fleethall-conditionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1savings-algorithmvehicle-routing

Suppose the capacities are ordered, C1<C2<⋯<CnC_1<C_2<\dots<C_nC1​<C2​<⋯<Cn​, and the smallest trucks are unlimited, x1=∞x_1=\inftyx1​=∞. Then for every finite multiset of run loads the following are equivalent:

  1. the loads pass the Table II test: for each i=1,…,ni=1,\dots,ni=1,…,n,
#{runs with load>Ci}≤∑k>ixk;\#\{\text{runs with load} > C_i\}\le \sum_{k>i}x_k ;#{runs with load>Ci​}≤k>i∑​xk​;
  1. the runs can be allocated to the trucks: each run receives a truck of a class whose capacity is at least its load, and no class iii receives more than xix_ixi​ runs.

This is what justifies condition (III): checking the columns of Table II decides whether the amended routes are "consistent with truck availabilities and capacities".

Formalization Note Both standing assumptions of p. 569 are needed: without x1=∞x_1=\inftyx1​=∞ the untested column "Up to C1C_1C1​" would bind, and without the order of the CiC_iCi​ the columns are not nested.

Preamble
import Mathlib
import Definitions.Def_SupplyChainTheory_vrp
import Definitions.Def_ClarkeWright64_Savings_Instance
Formal statement
namespace ClarkeWright64.Savings

/-- Clarke & Wright (1964), Computational procedure, condition (III), p. 573: when
`C₁ < ⋯ < C_n` and `x₁ = ∞`, a multiset of run loads passes the Table II test exactly when the
runs can be allocated to the available trucks without exceeding any truck's capacity. -/
theorem tableII_iff_fleetFeasible {M n : ℕ} (I : Instance M n) (hC : StrictMono I.C)
    (hx : I.x 0 = ⊤) (loads : Multiset ℝ) :
    I.TableIIOK loads ↔ I.FleetFeasible loads := by sorry

end ClarkeWright64.Savings
Source
Clarke & Wright, Scheduling of vehicles from a central depot to a number of delivery points, Oper. Res. 12 (1964), p. 573, Computational procedure, condition (III) and Table II; p. 569 (ordering of C_i, x_1 infinite)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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