Package: lp-solve (18.104.22.168-2)
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||Package Size||Installed Size||Files|
|amd64||286.3 kB||676.0 kB||[list of files]|
|arm64||261.3 kB||648.0 kB||[list of files]|
|armel||250.5 kB||614.0 kB||[list of files]|
|armhf||236.6 kB||450.0 kB||[list of files]|
|i386||302.0 kB||749.0 kB||[list of files]|
|mips64el||269.3 kB||738.0 kB||[list of files]|
|mipsel||270.6 kB||720.0 kB||[list of files]|
|ppc64el||304.4 kB||824.0 kB||[list of files]|
|s390x||263.9 kB||704.0 kB||[list of files]|