lrs home page 

 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. The program is intended for Unix/Linux platforms, but will compile using gcc/cygwin on Windows.

Download    

New: Release of v7.0: hybrid arithmetic versions of lrs/redund/mplrs offer speedups of 2-5 times for combinatorial polytopes.

Documentation:  User's Guide   lrslib Guide   Theoretical Description   Computational Results  Applications   
                                    mplrs/plrs Computational Results (new)    mplrs:Theoretical Description(new)       slides  
Drivers:


Interface: Libraries: Demos: Links to related software

David Avis               avis@cs.mcgill.ca      2018.10.30                  School of Informatics, Kyoto University and School of Computer Science, McGill University