lrslib Ver 4.2 is a
self-contained
ANSI C implementation
as a callable library 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. The program is intended for Unix/Linux platforms, but will
compile using gcc/cygwin on Windows.

Documentation:
User's
Guide Readme
lrslib
Guide Theoretical
Description
Computational
Results Download

Drivers:

- 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.

- redund: Removes
redundant inequalities from an H-representation. Finds the extremal
vertices in a V-representation

- nash, 2nash: Computes
all Nash equlibria of a two person non-cooperative game. Can handle
bounds on payoff functions. 2nash is a 2-processor parallel version

- fourier: Temporarily withdrawn due to
reported bugs.

- lrslib:
A
callable
library
of functions implementing the above drivers

- lrsmp: A multiple precision arithmetic package for lrslib
- lrslong: A fixed precision integer package for lrslib
- lrsgmp:
A
multiple
precision
arithmetic package for lrslib based on GNU MP.

- vedemo.c Compute vertices of a set of generated hypercubes
- chdemo.c Compute facets of a set of generated cyclic polytopes
- lpdemo.c Solve a set of linear programs for generated hypercubes

David Avis avis@i.kyoto-u.ac.jp School of Informatics, Kyoto University and School of Computer Science, McGill University