coinor-dylp
COIN-OR dynamic simplex linear program solver
DyLP is designed to find solutions of constrained linear mathematical optimization problems. To this end, it is using a full implementation of the so called dynamic simplex algorithm for linear programming. DyLP is part of the larger COIN-OR initiative (Computational Infrastructure for Operations Research).
homepage ↗ github: coin-or/DyLP
Available in
| Overlay | Newest | Ebuilds | Last activity | |
|---|---|---|---|---|
| gentoo gitweb ↗ | 1.10.4-r1 | 1 | 13 h | details › |
Versions & arches
Use flags of 1.10.4-r1
- doc Add extra documentation (API, Javadoc, etc). It is recommended to enable per package instead of globally
- examples Install examples, usually source code
- static-libs Build static versions of dynamic libraries as well
- test Enable dependencies and/or preparations necessary to run tests (usually controlled by FEATURES=test but can be toggled independently)