Tarkennettu haku
bullseye  ] [  bookworm  ] [  trixie  ] [  sid  ]
[ Source: lrslib  ]

Paketti: mplrs (0.71b-2)

Links for mplrs

Screenshot

Debian-palvelut:

Imuroi lähdekoodipaketti lrslib:

Ylläpitäjä:

External Resources:

Samankaltaisia paketteja:

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

Muut pakettiin mplrs liittyvät paketit

  • depends
  • recommends
  • suggests
  • enhances

Imuroi mplrs

Imurointi kaikille saataville arkkitehtuureille
Arkkitehtuuri Paketin koko Koko asennettuna Tiedostot
amd64 106.4 kt295.0 kt [tiedostoluettelo]