套件:liblrs2(0.73-2 以及其他的)
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.
其他與 liblrs2 有關的套件
|
|
|
|
下載 liblrs2
硬體架構 | 版本 | 套件大小 | 安裝後大小 | 檔案 |
---|---|---|---|---|
amd64 | 0.73-2 | 139。4 kB | 422。0 kB | [檔案列表] |
arm64 | 0.73-2 | 121。6 kB | 418。0 kB | [檔案列表] |
armel | 0.73-2+b1 | 91。0 kB | 263。0 kB | [檔案列表] |
armhf | 0.73-2+b1 | 94。7 kB | 203。0 kB | [檔案列表] |
i386 | 0.73-2+b1 | 116。1 kB | 335。0 kB | [檔案列表] |
mips64el | 0.73-2 | 115。4 kB | 433。0 kB | [檔案列表] |
ppc64el | 0.73-2 | 146。3 kB | 546。0 kB | [檔案列表] |
riscv64 | 0.73-2 | 144。4 kB | 350。0 kB | [檔案列表] |
s390x | 0.73-2 | 151。4 kB | 510。0 kB | [檔案列表] |