cddplus
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) if one run cdd with ”hull” option. 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. The program cdd+ is a C++ version of the ANSI C program cdd basically for the same purpose. The main difference is that it can be compiled for both rational (exact) arithmetic and floating point arithmetic. (Note that cdd runs on floating arithmetic only.)
This software is also referenced in ORMS.
This software is also referenced in ORMS.
Keywords for this software
References in zbMATH (referenced in 11 articles )
Showing results 1 to 11 of 11.
Sorted by year (- Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
- Bhardwaj, Avinash; Rostalski, Philipp; Sanyal, Raman: Deciding polyhedrality of spectrahedra (2015)
- Hampe, Simon: a-tint: a polymake extension for algorithmic tropical intersection theory (2014)
- Feller, Christian; Johansen, Tor Arne; Olaru, Sorin: An improved algorithm for combinatorial multi-parametric quadratic programming (2013)
- Kéri, Gerzson; Szántai, Tamás: Combinatorial results on the fitting problems of the multivariate gamma distribution introduced by Prékopa and Szántai (2012)
- Patrinos, Panagiotis; Sarimveis, Haralambos: A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings (2010)
- Quaeghebeur, Erik; De Cooman, Gert: Extreme lower probabilities (2008)
- Deza, Antoine; Indik, Gabriel: A counterexample to the dominating set conjecture (2007)
- Kojima, Masakazu; Kim, Sunyoung; Waki, Hayato: Sparsity in sums of squares of polynomials (2005)
- Andersen, Kasper K. S.; Bauer, Tilman; Grodal, Jesper; Pedersen, Erik Kjær: A finite loop space not rationally equivalent to a compact Lie group (2004)
- Gawrilow, Ewgenij; Joswig, Michael: polymake: an approach to modular software design in computational geometry (2001)