Skip to content
Sections
>> Trisquel >> Packages >> aramo >> math >> mplrs
aramo  ]
[ Source: lrslib  ]

Package: mplrs (0.71a-1)

package to enumerate vertices and extreme rays of a convex polyhedron (parallel binary)

A convex polyhedron is the set of points satisfying a finite family of linear inequalities. The study of the vertices and extreme rays of such systems is important and useful in e.g. mathematics and optimization. In a dual interpretation, finding the vertices of a (bounded) polyhedron is equivalent to finding the convex hull (bounding inequalities) of an (arbitrary dimensional) set of points. Lrs (lexicographic reverse search) has two important features that can be very important for certain applications: it works in exact arithmetic, and it consumes memory proportional to the input, no matter how large the output is.

This package contains the parallel binary mplrs for use with mpi

Other Packages Related to mplrs

  • depends
  • recommends
  • suggests
  • dep: libc6 (>= 2.11) [armhf]
    GNU C Library: Shared libraries
    also a virtual package provided by libc6-udeb
    dep: libc6 (>= 2.14) [amd64]
    dep: libc6 (>= 2.17) [arm64, ppc64el]
  • dep: libgmp10
    Multiprecision arithmetic library
  • dep: libopenmpi3 (>= 4.0.3)
    high performance message passing library -- shared library

Download mplrs

Download for all available architectures
Architecture Package Size Installed Size Files
amd64 107.1 kB299 kB [list of files]
arm64 94.1 kB282 kB [list of files]
armhf 78.6 kB150 kB [list of files]
ppc64el 121.5 kB467 kB [list of files]