Package: mplrs (0.71b-2)

[ Source: lrslib  ]

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

• dep: libc6 (>= 2.7)

  GNU C Library: Shared libraries
  also a virtual package provided by libc6-udeb

• dep: libgmp10 (>= 2:6.2.1+dfsg)

  Multiprecision arithmetic library

• dep: libopenmpi3 (>= 4.1.2)

  high performance message passing library -- shared library

Download mplrs

Download for all available architectures

Architecture	Package Size	Installed Size	Files
mipsel	81.2 kB	246.0 kB	[list of files]