Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, proof of Theorem 1, p. 13 — with fixed times the relaxation is the flow system (6)–(11) without the forced-zero arcs

Proved
OnlineTaxiRouting.Integrality.relax_eq_flow_of_fixed

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

lp-relaxationmixed-integer-programmingnetwork-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1taxi-routing

Consider a taxi routing instance with fixed pick-up times tcmin⁡=tcmax⁡=:tc∗t^{\min}_c = t^{\max}_c =: t^*_ctcmin​=tcmax​=:tc∗​ for all customers ccc. Let

A={(c′,c):Tc′,c≤tc∗−tc′∗},B={(k,c):tkinit+Tk,c≤tc∗}.A = \{(c', c) : T_{c',c} \le t^*_c - t^*_{c'}\}, \qquad B = \{(k, c) : t^{\mathrm{init}}_k + T_{k,c} \le t^*_c\}.A={(c′,c):Tc′,c​≤tc∗​−tc′∗​},B={(k,c):tkinit​+Tk,c​≤tc∗​}.

Then a point (x,y,p,t)(x, y, p, t)(x,y,p,t) lies in the LP relaxation of (5)–(14) if and only if t=t∗t = t^*t=t∗ and (x,y,p)(x, y, p)(x,y,p) lies in the relaxed network-flow system (6)–(11) on the arc subset A∪BA \cup BA∪B, i.e. satisfies (6)–(8), 0≤x,y,p≤10 \le x, y, p \le 10≤x,y,p≤1, xc′,c=0x_{c',c} = 0xc′,c​=0 for (c′,c)∉A(c',c) \notin A(c′,c)∈/A and yk,c=0y_{k,c} = 0yk,c​=0 for (k,c)∉B(k,c) \notin B(k,c)∈/B.

In words: with fixed times, (13) forces xc′,c=0x_{c',c} = 0xc′,c​=0 exactly when Tc′,c−(tc∗−tc′∗)>0T_{c',c} - (t^*_c - t^*_{c'}) > 0Tc′,c​−(tc∗​−tc′∗​)>0 and is otherwise inactive; the same reasoning applied to (14) forces yk,c=0y_{k,c} = 0yk,c​=0 exactly when tkinit+Tk,c−tc∗>0t^{\mathrm{init}}_k + T_{k,c} - t^*_c > 0tkinit​+Tk,c​−tc∗​>0. This is the second step of the proof of Theorem 1: the feasible region in (x,y,p)(x, y, p)(x,y,p) is that of the network-flow constraints with some variables removed.

Formalization Note The standing acyclicity assumption of §2.1 is not needed and is omitted. The page states the taxi-arc case only as "the same reasoning applies to Constraint (14)"; the set BBB above is that reasoning written out.

Preamble
import Mathlib
import Definitions.Def_OnlineTaxiRouting_Integrality_Setting
Formal statement
namespace OnlineTaxiRouting.Integrality

theorem relax_eq_flow_of_fixed {C K : Type*} [Fintype C] [Fintype K]
    (I : Instance C K) (hfix : ∀ c, I.tmin c = I.tmax c) :
    relax I = {v | (v.1, v.2.1, v.2.2.1) ∈
        flowRelax (fun c' c => I.T c' c ≤ I.tmin c - I.tmin c')
          (fun k c => I.tinit k + I.Tk k c ≤ I.tmin c) ∧
      v.2.2.2 = I.tmin} := by sorry

end OnlineTaxiRouting.Integrality
Source
Bertsimas–Jaillet–Martin, accepted manuscript (March 2018), §3.2, proof of Theorem 1, p. 13
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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