Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2 — a satellite supply bound θ that needs too many second-level vehicles makes F(M) infeasible

Proved
TwoEchelonCVRP.Config.proposition_2

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1pruningtwo-echelonvehicle-routing

Let M∈PM\in\mathcal PM∈P be a configuration and let θ(k)\theta(k)θ(k), k∈NS(M)k\in N_S(M)k∈NS​(M), be real numbers such that every feasible solution of F(M)F(M)F(M) supplies at least θ(k)\theta(k)θ(k) to satellite kkk:

θ(k)≤∑r∈Mkqkrfor every feasible solution of F(M) and every k∈NS(M).\theta(k)\le\sum_{r\in M_k}q_{kr}\qquad\text{for every feasible solution of }F(M)\text{ and every }k\in N_S(M).θ(k)≤r∈Mk​∑​qkr​for every feasible solution of F(M) and every k∈NS​(M).

If

∑k∈NS(M)⌈θ(k)Q2⌉>m2or⌈θ(k)Q2⌉>mk  for some k∈NS(M),\sum_{k\in N_S(M)}\Bigl\lceil\frac{\theta(k)}{Q_2}\Bigr\rceil>m^2\qquad\text{or}\qquad\Bigl\lceil\frac{\theta(k)}{Q_2}\Bigr\rceil>m_k\ \text{ for some }k\in N_S(M),k∈NS​(M)∑​⌈Q2​θ(k)​⌉>m2or⌈Q2​θ(k)​⌉>mk​  for some k∈NS​(M),

then F(M)F(M)F(M) has no feasible solution, so MMM can be removed from P\mathcal PP.

This is the second pruning test used to generate P\mathcal PP.

Formalization Note The ceilings are integer ceilings of real numbers. The paper writes "for some k∈NSk\in N_Sk∈NS​"; θ\thetaθ is only defined on NS(M)N_S(M)NS​(M), so the condition is read for k∈NS(M)k\in N_S(M)k∈NS​(M). The bound θ\thetaθ is a hypothesis; the paper's way of computing it, problem (27)–(32), is not part of this statement.

Preamble
import Mathlib
import Definitions.Def_TwoEchelonCVRP_Config_Configuration
Formal statement
namespace TwoEchelonCVRP.Config

/-- Proposition 2, p. 305: let `M ∈ 𝒫` and let `θ(k)`, `k ∈ N_S(M)`, be a lower bound on the
quantity `∑_{r ∈ M_k} q_{kr}` supplied to satellite `k` in every feasible F(M) solution. If
`∑_{k ∈ N_S(M)} ⌈θ(k)/Q_2⌉ > m^2`, or `⌈θ(k)/Q_2⌉ > m_k` for some `k ∈ N_S(M)`, then F(M) has no
feasible solution. -/
theorem proposition_2 (I : Instance) (RS : RouteSystem I) (M : Finset RS.FR) (hMP : InP RS M)
    (θ : Fin I.ns → ℝ)
    (hθ : ∀ t : SolFM RS, IsFeasibleFM RS M t → ∀ k ∈ NS RS M, θ k ≤ ∑ r ∈ Mk RS M k, t.qd r k)
    (htest : (I.m2 : ℤ) < ∑ k ∈ NS RS M, ⌈θ k / (I.Q2 : ℝ)⌉ ∨
      ∃ k ∈ NS RS M, (I.m k : ℤ) < ⌈θ k / (I.Q2 : ℝ)⌉) :
    ∀ t : SolFM RS, ¬ IsFeasibleFM RS M t := by sorry

end TwoEchelonCVRP.Config
Source
Baldacci, Mingozzi, Roberti & Wolfler Calvo, An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem, Oper. Res. 61(2) (2013), p. 305, Proposition 2
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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