An oriented matroid program is an abstraction of a linear program. For a non-euclidean oriented matroid, there is an analog to the simplex algorithm that results in an infinite loop. I will show how to obtain a final polynomial from the infinite loop.
This is the second of two talks based on "Euclideanness and final polynomials in matroid theory" by Jürgen Richter-Gebert. Final polynomials were defined in the first talk. The talk will include a brief review of final polynomials, but details will be excluded.