Skip to content
Sections
>> Trisquel >> Paketler >> aramo >> math >> mplrs
aramo  ]
[ Kaynak: lrslib  ]

Paket: 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

mplrs ile İlgili Diğer Paketler

  • bağımlılıklar
  • tavsiye edilen
  • önerilen
  • dep: libc6 (>= 2.17)
    GNU C Library: Shared libraries
    ayrıca şunun tarafından sağlanan bir sanal paket libc6-udeb
  • dep: libgmp10
    Multiprecision arithmetic library
  • dep: libopenmpi3 (>= 4.0.3)
    high performance message passing library -- shared library

mplrs indir

Tüm mevcut mimariler için indir
Mimari Paket Boyutu Kurulu Boyut Dosyalar
ppc64el 121,5 kB467 kB [dosya listesi]