|
|
| Distribution |
Debian unstable |
| Abteilung |
math |
| Quelle |
lrslib |
| Version |
0.42c-1 |
| Maintainer |
David Bremner <bremner@unb.ca>
|
| Beschreibung |
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.
|
| Abhängig von | libc6 (>= 2.7), libgmp3c2 |
| Offizielle Seiten |
Paket
Entwicklerinformationen
Bugs (Binärpaket)
Bugs (Quellpaket) |
| Download |
amd64 |
|
|
|
