Linear Programming

Julian Parsert 🌐 and Cezary Kaliszyk 🌐

August 6, 2019

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 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.


BSD License


Session Linear_Programming