Balík: liblrs-dev (0.70-3)

[ Zdroj: lrslib  ]

package to enumerate vertices and extreme rays (development file)

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 optional headers, and a unversioned symlink to the library, useful for developers.

Značky: Software Development: Knižnice, Role: Vývojová knižnica

Ostatné balíky súvisiace s balíkom liblrs-dev

• dep: liblrs0 (= 0.70-3)

  package to enumerate vertices and extreme rays (shared libraries)

Stiahnuť liblrs-dev

Stiahnuť pre všetky dostupné architektúry

Architektúra	Veľkosť balíka	Nainštalovaná veľkosť	Súbory
amd64	13.9 kB	75.0 kB	[zoznam súborov]
arm64	13.9 kB	75.0 kB	[zoznam súborov]
armhf	13.9 kB	75.0 kB	[zoznam súborov]
i386	13.9 kB	75.0 kB	[zoznam súborov]