- Name: cdd
- Version: 0.61a
- Release: 4mdv2010.1
- Epoch:
- Group: Sciences/Mathematics
- License: GPL
- Url: http://www.ifor.math.ethz.ch/~fukuda/cdd_home/index.html
- Summary: Implementation of the Double Description Method of Motzkin et al
- Architecture: x86_64
- Size: 1892288
- Distribution: Mandriva Linux
- Vendor: Mandriva
- Packager: Paulo Andrade <pcpa@mandriva.com.br>
Description:
The program cdd 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 : A x <= b }
where A is an m x d real matrix and b is a real m dimensional vector.
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.
- BuildArch:
- ExcludeArch:
- ExclusiveArch:
- Cookie: celeste.mandriva.com 1267216608
- Buildhost: celeste.mandriva.com