### Abstract

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.

### License

BSD License

### Topics

- Mathematics/Algebra

### Session LP_Duality

- Minimum_Maximum
- LP_Duality

### Depends on

- Linear Inequalities

### Auto-related entries

- Interpolation Polynomials (in HOL-Algebra)

## Cite

×

LP_Duality-AFP

    @article{LP_Duality-AFP,
      author  = {René Thiemann},
      title   = {Duality of Linear Programming},
      journal = {Archive of Formal Proofs},
      month   = {February},
      year    = {2022},
      note    = {\url{https://isa-afp.org/entries/LP_Duality.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Feb 6, 2022 : Isabelle2021-1