Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Existence of integer optimal flows and integer dual optima

Proved
LinearOptimization.network_integer_optimum_exists

by Shuze Chen · Aug 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

dualityintegralitynetwork-flows

(Bertsimas & Tsitsiklis, Corollary 7.2, p. 290) Consider an uncapacitated network flow problem, and assume that the optimal cost is finite.

  • (a) If all supplies bib_ibi​ are integer, there exists an integer optimal flow vector.
  • (b) If all cost coefficients cijc_{ij}cij​ are integer, there exists an integer optimal solution to the dual problem.

(Stated in §7.3 under standing Assumption 7.1: ∑i∈Nbi=0\sum_{i\in\mathcal{N}}b_i=0∑i∈N​bi​=0 and the graph connected. The dual problem is the LP dual of the standard-form problem min⁡c′f\min \mathbf{c}'\mathbf{f}minc′f s.t. A~f=b~\tilde{\mathbf{A}}\mathbf{f}=\tilde{\mathbf{b}}A~f=b~, f≥0\mathbf{f}\ge 0f≥0.)

Preamble
import Definitions.Def_LinearOptimization_NetworkFlowProblem
import Definitions.Def_Polyhedron
import Definitions.Def_LinearOptimization_DualLP


open Matrix

/-- **Bertsimas & Tsitsiklis, Corollary 7.2 (p. 290).** For the uncapacitated network flow
problem `min c'f, Ãf = b̃, f ≥ 0` on a connected graph with `∑ᵢ bᵢ = 0`
and finite optimal cost: integer supplies yield an integer optimal flow
vector, and integer costs yield an integer optimal solution of the dual
`max p'b̃, p'Ã ≤ c'`. -/
Formal statement
theorem LinearOptimization.network_integer_optimum_exists {n m : ℕ}
    (arcs : Fin m → Fin (n + 1) × Fin (n + 1)) (bsupply : Fin (n + 1) → ℝ)
    (cost : Fin m → ℝ)
    (hloop : HasNoSelfLoops arcs) (hconn : IsConnectedNetwork arcs)
    (hsum : ∑ i, bsupply i = 0)
    (hfin :
      lpValue cost
          (stdPolyhedron (truncatedIncidence arcs) (truncatedSupply bsupply)) ≠ ⊤ ∧
      lpValue cost
          (stdPolyhedron (truncatedIncidence arcs) (truncatedSupply bsupply)) ≠ ⊥) :
    ((∀ i, ∃ z : ℤ, bsupply i = (z : ℝ)) →
      ∃ f, IsLpOptimal cost
          (stdPolyhedron (truncatedIncidence arcs) (truncatedSupply bsupply)) f ∧
        ∀ k, ∃ z : ℤ, f k = (z : ℝ)) ∧
    ((∀ k, ∃ z : ℤ, cost k = (z : ℝ)) →
      ∃ p, IsLpDualOptimal (truncatedSupply bsupply)
          (dualFeasibleStd (truncatedIncidence arcs) cost) p ∧
        ∀ i, ∃ z : ℤ, p i = (z : ℝ)) := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Corollary 7.2, p. 290

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