Duality of Linear Programming

RenĂ© Thiemann đŸ“§

February 3, 2022

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


We formalize the weak and strong duality theorems of linear programming. For the strong duality theorem we provide three sufficient preconditions: both the primal problem and the dual problem are satisfiable, the primal problem is satisfiable and bounded, or the dual problem is satisfiable and bounded. The proofs are based on an existing formalization of Farkas' Lemma.


BSD License


Session LP_Duality

Depends on