Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strong duality with a polyhedral constraint set

Proved
LinearOptimization.lp_general_strong_duality

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

dualitylagrangean-dualitylinear-programmingstrong-duality

(Theorem 4.18, Strong duality — Bertsimas & Tsitsiklis, p. 184.) With the same setup as Theorem 4.17 (primal: minimize c′xc'xc′x subject to Ax≥bAx \ge bAx≥b, x∈Px \in Px∈P with P={x∣Dx≥d}P = \{x \mid Dx \ge d\}P={x∣Dx≥d}; dual: maximize g(p)=min⁡x∈P[c′x+p′(b−Ax)]g(p) = \min_{x \in P}[c'x + p'(b - Ax)]g(p)=minx∈P​[c′x+p′(b−Ax)] subject to p≥0p \ge 0p≥0):

if the primal problem has an optimal solution, so does the dual, and the respective optimal costs are equal.

Preamble
import Definitions.Def_Polyhedron
import Definitions.Def_LinearOptimization_LagrangeanDual


open Matrix

/-- **Bertsimas & Tsitsiklis, Theorem 4.18 (p. 184).** Strong duality for the general dual,
attainment form: if `x*` is optimal for `min c'x` over
`{y | Ay ≥ b, y ∈ P}` (`P = {y | Dy ≥ d}`), then some `p ≥ 0` maximizes
`g` over the nonnegative orthant and `g(p) = c'x*`. -/
Formal statement
theorem LinearOptimization.lp_general_strong_duality {m₁ m₂ n : ℕ}
    (A : Matrix (Fin m₁) (Fin n) ℝ) (b : Fin m₁ → ℝ) (c : Fin n → ℝ)
    (D : Matrix (Fin m₂) (Fin n) ℝ) (d : Fin m₂ → ℝ)
    (xstar : Fin n → ℝ)
    (hopt : IsLpOptimal c {y | b ≤ A.mulVec y ∧ y ∈ polyhedron D d} xstar) :
    ∃ p : Fin m₁ → ℝ, 0 ≤ p ∧
      (∀ q : Fin m₁ → ℝ, 0 ≤ q →
        lagrangeanObjective A b c (polyhedron D d) q ≤
          lagrangeanObjective A b c (polyhedron D d) p) ∧
      lagrangeanObjective A b c (polyhedron D d) p =
        ((c ⬝ᵥ xstar : ℝ) : EReal) := by
  sorry
Source
Bertsimas & Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997, Theorem 4.18, p. 184
Human review
  • Endorsed by Shuze Chen · Nov 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 3, 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