| Name : cdd
| |
| Version : 0.61a
| Vendor : Mandriva
|
| Release : 1mdv2009.1
| Date : 2009-03-06 21:00:51
|
| Group : Sciences/Mathematics
| Source RPM : cdd-0.61a-1mdv2009.1.src.rpm
|
| Size : 0.60 MB
| |
| Packager : Paulo Andrade < pcpa_mandriva_com_br>
| |
| Summary : Implementation of the Double Description Method of Motzkin et al
|
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.
|
RPM found in directory: /vol/rzm6/linux-mandriva/official/2009.1/i586/media/contrib/release |
