[ 源代码： lrslib ]
软件包：mplrs（0.71a-1）
package to enumerate vertices and extreme rays of a convex polyhedron (parallel binary)
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 parallel binary mplrs for use with mpi
其他与 mplrs 有关的软件包
|
|
|
|
-
- dep: libc6 (>= 2.17)
- GNU C 语言运行库：共享库
同时作为一个虚包由这些包填实： libc6-udeb
-
- dep: libgmp10
- 多精度运算库
-
- dep: libopenmpi3 (>= 4.0.5)
- high performance message passing library -- shared library