Duality of Linear Programming (Q7361081)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry LP_Duality
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Duality of Linear Programming |
AFP entry LP_Duality |
Statements
3 February 2022
0 references
René Thiemann
0 references
Duality of Linear Programming (English)
0 references
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.
0 references
