Sat, 28 Sep 2024 04:40:20 UTC | login

Information for RPM cddlib-1:0.94j-2.fc31.src.rpm

ID389908
Namecddlib
Version0.94j
Release2.fc31
Epoch1
Archsrc
SummaryA library for generating all vertices in convex polyhedrons
DescriptionThe C-library cddlib is a C implementation of the Double Description Method of Motzkin et al. for generating all vertices (i.e. extreme points) and extreme rays of a general convex polyhedron in R^d given by a system of linear inequalities: P = { x=(x1, ..., xd)^T : b - A x >= 0 } where A is a given m x d real matrix, b is a given m-vector and 0 is the m-vector of all zeros. The program can be used for the reverse operation (i.e. convex hull computation). This means that one can move back and forth between an inequality representation and a generator (i.e. vertex and ray) representation of a polyhedron with cdd. Also, cdd can solve a linear programming problem, i.e. a problem of maximizing and minimizing a linear function over P.
Build Time2019-07-26 23:13:20 GMT
Size1.31 MB
4a0b82605f6f9e3ccd6ee1453b66ef6c
LicenseGPLv2+
Buildrootf31-build-56789-28241
Provides No Provides
Obsoletes No Obsoletes
Conflicts No Conflicts
Requires
gcc
gmp-devel
libtool
rpmlib(CompressedFileNames) <= 3.0.4-1
rpmlib(FileDigests) <= 4.6.0-1
tex(latex)
Recommends No Recommends
Suggests No Suggests
Supplements No Supplements
Enhances No Enhances
Files
1 through 4 of 4
Name ascending sort Size
cdd_both_reps.c6.29 KB
cddlib-0.94j.tar.gz1.30 MB
cddlib-sagemath.patch1012.00 B
cddlib.spec8.92 KB
Component of No Buildroots