Simplex Algorithm
Stores constraints as a matrix with rational coefficients
A set of constraints is solved when it admits only one (numerical) solution
The proof objects generated will always be trivial:
qɬ : q > 0
0>=0 : 0 >= 0
(>>= qɬ) : q >= 0
Previous slide
Next slide
Back to first slide
View graphic version