lrsnash
package to enumerate vertices and extreme rays of a convex polyhedron
Install
 All systems

curl cmd.cat/lrsnash.sh
 Debian

aptget install lrslib
 Ubuntu

aptget install lrslib
 Arch Linux

pacman S lrs
 Kali Linux

aptget install lrslib
 Fedora

dnf install lrslibutils
 Windows (WSL2)

sudo aptget update
sudo aptget install lrslib
 Raspbian

aptget install lrslib
 Dockerfile
 dockerfile.run/lrsnash
lrslib
package to enumerate vertices and extreme rays of a convex polyhedron
A convex polyhedron is the set of points satisfying a finite family of linear inequalities. The study of the vertices and extreme rays of such systems is important and useful in e.g. mathematics and optimization. In a dual interpretation, finding the vertices of a (bounded) polyhedron is equivalent to finding the convex hull (bounding inequalities) of an (arbitrary dimensional) set of points. Lrs (lexicographic reverse search) has two important features that can be very important for certain applications: it works in exact arithmetic, and it consumes memory proportional to the input, no matter how large the output is.