Download Source Package lp-solve:
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.
Homepage http://www.geocities.com/lpsolve/
|
|
|
| Architecture | Package Size | Installed Size | Files |
|---|---|---|---|
| amd64 | 325.7 kB | 720 kB | [list of files] |
| armel | 325.0 kB | 684 kB | [list of files] |
| hppa | 335.1 kB | 720 kB | [list of files] |
| i386 | 306.1 kB | 660 kB | [list of files] |
| ia64 | 472.3 kB | 1332 kB | [list of files] |
| mips | 333.9 kB | 828 kB | [list of files] |
| mipsel | 335.0 kB | 828 kB | [list of files] |
| powerpc | 326.4 kB | 728 kB | [list of files] |
| s390 | 323.8 kB | 692 kB | [list of files] |
| sparc | 305.3 kB | 688 kB | [list of files] |