Filewatcher File Search File Search
Content Search
» » » » »


package to enumerate vertices and extreme rays (shared libraries)

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.

This package contains the (required) shared library.

Package version:0.42c-1+b1


lrslib (0.42c-1+b1) sid; urgency=low

  * Binary-only non-maintainer upload for sparc; no source changes.
  * Rebuild against libgmp10

 -- sparc Build Daemon (schroeder) <>  Mon, 04 Apr 2011 05:56:07 +0000

lrslib (0.42c-1) unstable; urgency=low

  * Initial release (Closes: #454469)

 -- David Bremner <>  Fri, 16 Oct 2009 22:09:17 -0300



Files: *
Copyright: © Copyright 1999-2006 David Avis <>
License: GPL2+
    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foun

Browse inside liblrs0d_0.42c-1+b1_sparc.deb

         [DIR]DEBIAN/ (6)  65535+ mirrors
         [DIR]usr/ (2)  65535+ mirrors

Download liblrs0d_0.42c-1+b1_sparc.deb

Results 1 - 1 of 1
Help - FTP Sites List - Software Dir.
Search over 15 billion files
© 1997-2017