lrslib is a self-contained ANSI C implementation of the reverse search algorithm for vertex enumeration/convex hull problems and comes with a choice of three arithmetic packages. Input file formats are compatible with Komei Fukuda's cdd package. All computations are done exactly in either multiple precision or fixed integer arithmetic. Output is not stored in memory, so even problems with very large output sizes can sometimes be solved.
lrs: Converts an H-representation (half-space) of a polyhedron
to a V-representation (vertex/ray) or vice versa.
Estimates the number of vertices/rays or facets of a polyhedron.
Computes the volume of a polytope given by a list of vertices.
Solves LP problems over a polyhedron given by an H-representation.
Compute the Voronoi vertices and rays for an input set of data points.
New: vertex/facet cross reference list can be created.
redund: Removes redundant inequalities from an H-representation.
Finds the extremal vertices in a V-representation
lrsnash, 2nash: Computes all Nash equlibria of a two person non-cooperative
game.
2nash is a 2-processor parallel version
Build/run tested in amd64, there exist a mplrs target for parallel comp, though
I avoided it, to keep it light.
Any comments?
lrslib.tar.gz
Description: application/gzip
