软件包:lp-solve(5.5.2.11-2)
lp-solve 的相关链接
Debian 的资源:
下载源码包 lp-solve:
- [lp-solve_5.5.2.11-2.dsc]
- [lp-solve_5.5.2.11.orig-doc.tar.gz]
- [lp-solve_5.5.2.11.orig.tar.gz]
- [lp-solve_5.5.2.11-2.debian.tar.xz]
维护小组:
外部的资源:
- 主页 [lpsolve.sourceforge.net]
相似软件包:
Solve (mixed integer) linear programming problems
The linear programming (LP) problem can be formulated as: Solve A.x >= V1, with V2.x maximal. A is a matrix, x is a vector of (nonnegative) variables, V1 is a vector called the right hand side, and V2 is a vector specifying the objective function.
An integer linear programming (ILP) problem is an LP with the constraint that all the variables are integers. In a mixed integer linear programming (MILP) problem, some of the variables are integer and others are real.
The program lp_solve solves LP, ILP, and MILP problems. It is slightly more general than suggested above, in that every row of A (specifying one constraint) can have its own (in)equality, <=, >= or =. The result specifies values for all variables.
lp_solve uses the 'Simplex' algorithm and sparse matrix methods for pure LP problems. If one or more of the variables is declared integer, the Simplex algorithm is iterated with a branch and bound algorithm, until the desired optimal solution is found. lp_solve can read MPS format input files.
其他与 lp-solve 有关的软件包
|
|
|
|
-
- dep: libc6 (>= 2.34) [i386, riscv64]
- GNU C 语言运行库:共享库
同时作为一个虚包由这些包填实: libc6-udeb
- dep: libc6 (>= 2.38) [除 i386, riscv64]
-
- dep: libcolamd3 (>= 1:7.0.1)
- column approximate minimum degree ordering library for sparse matrices
下载 lp-solve
硬件架构 | 软件包大小 | 安装后大小 | 文件 |
---|---|---|---|
amd64 | 288.0 kB | 697.0 kB | [文件列表] |
arm64 | 263.4 kB | 693.0 kB | [文件列表] |
armel | 246.8 kB | 615.0 kB | [文件列表] |
armhf | 233.9 kB | 447.0 kB | [文件列表] |
i386 | 303.4 kB | 762.0 kB | [文件列表] |
mips64el | 268.9 kB | 746.0 kB | [文件列表] |
ppc64el | 309.6 kB | 885.0 kB | [文件列表] |
riscv64 | 292.8 kB | 577.0 kB | [文件列表] |
s390x | 298.3 kB | 753.0 kB | [文件列表] |