Package: lp-solve (184.108.40.206-4 and others)
Links for lp-solve
Download Source Package lp-solve:
- Homepage [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.
Other Packages Related to lp-solve
|Architecture||Version||Package Size||Installed Size||Files|
|amd64||220.127.116.11-4+b1||275.8 kB||662.0 kB||[list of files]|
|arm64||18.104.22.168-4+b1||228.3 kB||569.0 kB||[list of files]|
|armel||22.214.171.124-4+b1||242.0 kB||616.0 kB||[list of files]|
|armhf||126.96.36.199-4+b1||228.6 kB||434.0 kB||[list of files]|
|i386||188.8.131.52-4+b1||293.8 kB||736.0 kB||[list of files]|
|mips||184.108.40.206-4+b1||255.9 kB||698.0 kB||[list of files]|
|mips64el||220.127.116.11-4+b1||259.0 kB||724.0 kB||[list of files]|
|mipsel||18.104.22.168-4+b1||259.8 kB||698.0 kB||[list of files]|
|ppc64el||22.214.171.124-4+b1||254.4 kB||750.0 kB||[list of files]|
|s390x||126.96.36.199-4+b1||262.2 kB||732.0 kB||[list of files]|