Пакунок: mplrs (0.71a-1)

[ 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

Інші пакунки пов'язані з mplrs

• dep: libc6 (>= 2.7)

  Бібліотека GNU C: спільні бібліотеки
  also a virtual package provided by libc6-udeb

• dep: libgmp10

  Арифметична бібліотека багатоточності

• dep: libopenmpi3 (>= 4.0.5)

  high performance message passing library -- shared library

Завантажити mplrs

Завантаження для всіх доступних архітектур

Архітектура	Розмір пакунка	Розмір після встановлення	Файли
s390x	93.0 kB	311.0 kB	[список файлів]