diff options
Diffstat (limited to 'sci-libs/cddlib/metadata.xml')
| -rw-r--r-- | sci-libs/cddlib/metadata.xml | 39 |
1 files changed, 21 insertions, 18 deletions
diff --git a/sci-libs/cddlib/metadata.xml b/sci-libs/cddlib/metadata.xml index 816c168dca97..a93a12f9174f 100644 --- a/sci-libs/cddlib/metadata.xml +++ b/sci-libs/cddlib/metadata.xml @@ -2,25 +2,28 @@ <!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd"> <pkgmetadata> <maintainer type="project"> - <email>sci@gentoo.org</email> - <name>Gentoo Science Project</name> + <email>sci-mathematics@gentoo.org</email> + <name>Gentoo Mathematics Project</name> </maintainer> <longdescription lang="en"> -The 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: + The 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 } - 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. -</longdescription> + 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. + </longdescription> + <use> + <flag name="tools">Add a few executables and tests for cddlib</flag> + </use> </pkgmetadata> |