Linear Programming (Q7361925)
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 Linear_Programming
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear Programming |
AFP entry Linear_Programming |
Statements
6 August 2019
0 references
Julian Parsert
0 references
Cezary Kaliszyk
0 references
Linear Programming (English)
0 references
We use the previous formalization of the general simplex algorithm to formulate an algorithm for solving linear programs. We encode the linear programs using only linear constraints. Solving these constraints also solves the original linear program. This algorithm is proven to be sound by applying the weak duality theorem which is also part of this formalization.
0 references
