Pakket: lp-solve (5.5.2.11-2)
Verwijzigingen voor lp-solve
Debian bronnen:
Het bronpakket lp-solve downloaden:
- [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]
Beheerders:
- Juan Esteban Monsalve Tobon (QA-pagina)
- Rene Engelhard (QA-pagina)
- Anibal Monsalve Salazar (QA-pagina)
Externe bronnen:
- Homepage [lpsolve.sourceforge.net]
Vergelijkbare pakketten:
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.
Andere aan lp-solve gerelateerde pakketten
|
|
|
|
-
- dep: libc6 (>= 2.38)
- GNU C Bibliotheek: Gedeelde bibliotheken
Ook een virtueel pakket geboden door: libc6-udeb
-
- dep: libcolamd3 (>= 1:7.0.1)
- column approximate minimum degree ordering library for sparse matrices