Package: lrslib (0.70-3)

[ Source: lrslib  ]

package to enumerate vertices and extreme rays of a convex polyhedron

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.

Tags: Role: Program

Other Packages Related to lrslib

• dep: libc6 (>= 2.17) [arm64]

  GNU C 라이브러리: 공유 라이브러리
  also a virtual package provided by libc6-udeb

  dep: libc6 (>= 2.7) [not arm64]

• dep: libgmp10

  Multiprecision 연산 라이브러리

• dep: liblrs0 (>= 0.70)

  package to enumerate vertices and extreme rays (shared libraries)

Download lrslib

Download for all available architectures

Architecture	Package Size	Installed Size	Files
amd64	29.0 kB	96.0 kB	[list of files]
arm64	28.3 kB	76.0 kB	[list of files]
armhf	27.6 kB	65.0 kB	[list of files]
i386	30.0 kB	89.0 kB	[list of files]