Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Zero duality gap certifies optimality

Proved
LinearOptimization.lp_optimal_certificate

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

certificatedualitylinear-programmingoptimality

(Corollary 4.2) Let xxx and ppp be feasible solutions to the primal and the dual, respectively, and suppose that

p′b=c′x.p'b = c'x.p′b=c′x.

Then, xxx and ppp are optimal solutions to the primal and the dual, respectively.

Preamble
import Definitions.Def_LinearOptimization_DualLP


open Matrix

/-- **Bertsimas & Tsitsiklis, Corollary 4.2 (p. 148).** Feasible `x` and `p` with
`p'b = c'x` are automatically optimal for the primal and the dual,
respectively. -/
Formal statement
theorem LinearOptimization.lp_optimal_certificate {m n : ℕ} (P : GeneralFormLP m n)
    (x : Fin n → ℝ) (hx : x ∈ generalFeasibleSet P)
    (p : Fin m → ℝ) (hp : p ∈ generalFeasibleSet (dualLP P))
    (heq : p ⬝ᵥ P.b = P.c ⬝ᵥ x) :
    IsLpOptimal P.c (generalFeasibleSet P) x ∧
    IsLpDualOptimal P.b (generalFeasibleSet (dualLP P)) p := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Corollary 4.2, p. 148

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