Algorithms for finding tight UTVPI (octagonal) over-approximations of polyhedra using linear programming and Fourier-Motzkin elimination
-
Updated
Jul 17, 2019 - C++
#
fourier-motzkin-elimination
Here are 2 public repositories matching this topic...
Implementation of the Fourier-Motzkin algorithm in C++. Fourier–Motzkin elimination is a algorithm for eliminating variables from a system of linear inequalities. In practice it is used e.g. for deciding if a set is non-empty
-
Updated
May 9, 2021 - C++
Improve this page
Add a description, image, and links to the fourier-motzkin-elimination topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the fourier-motzkin-elimination topic, visit your repo's landing page and select "manage topics."