 | This is not a Wikipedia article: It is an individual user's work-in-progress page, and may be incomplete and/or unreliable. For guidance on developing this draft, see Wikipedia:So you made a userspace draft. Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
| Initial release | 2000-10 |
|---|---|
| Stable release | 0.11.2
/ 2011-02-27 |
| Written in | C++ |
| Type | Mathematical optimization |
| License | GPLv3 |
| Website | www |
The Parma Polyhedra Library is a toolkit for representing, analyzing, and solving numerical optimization problems.
Summary
editThe Parma Polyhedra Library (PPL) provides numerical abstractions especially targeted at applications in the field of analysis and verification of complex systems. These abstractions include convex polyhedra [...]; some special classes of polyhedra shapes that offer interesting complexity/precision tradeoffs; and grids which represent regularly spaced points that satisfy a set of linear congruence relations. The library also supports finite powersets and products of (any kind of) polyhedra and grids, a mixed integer linear programming problem solver using an exact-arithmetic version of the simplex algorithm, a parametric integer programming solver, and primitives for the termination analysis via the automatic synthesis of linear ranking functions.[1]
Name
editIt was initially developed in Parma[2], Italy, and one of its core abstractions is polyhedra formed by intersecting half-spaces.
Applications
editAs of early 2011, it is a (optional) prerequisite library that allows recent versions of GCC to provide certain powerful optimizations. In particular, it enables the use of the Graphite (GCC) optimization framework via CLooG.
Many other software packages rely upon this library[3].
References
editExternal links
editCategory:Free compilers and interpreters Category:Mathematical Optimization