Package: lp-solve Status: install ok installed Priority: optional Section: math Installed-Size: 676 Maintainer: Juan Esteban Monsalve Tobon <esteban@v7w.com> [Debian Bug Report] Architecture: amd64 Version: 5.5.2.5-2 Depends: libc6 (>= 2.29), libcolamd2 (>= 1:4.5.2) Description: 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. Homepage: http://lpsolve.sourceforge.net Files owned by package lp-solve: /usr /usr/bin /usr/bin/lp_solve /usr/lib /usr/lib/lp_solve /usr/lib/lp_solve/liblpsolve55.so /usr/share /usr/share/doc /usr/share/doc/lp-solve /usr/share/doc/lp-solve/NEWS.Debian.gz /usr/share/doc/lp-solve/README.Debian /usr/share/doc/lp-solve/README.txt.gz /usr/share/doc/lp-solve/changelog.Debian.gz /usr/share/doc/lp-solve/copyright /usr/share/doc/lp-solve/examples /usr/share/doc/lp-solve/examples/demo.c /usr/share/man /usr/share/man/man1 /usr/share/man/man1/lp_solve.1.gz