lp-solve 5.5.0.13-7 source package in Ubuntu Linaro Evaluation Build
Changelog
lp-solve (5.5.0.13-7) unstable; urgency=low
* move to "3.0 (quilt)" format; move downloaded docs into extra docs
tarball and move change from 5.5.0.10-6 from only in .diff.gz (oops!)
to proper patch
* include headers needed for plugin libraries (closes: #555830), thanks
Matthias Kümmerer
* add ${misc:Depends}
* remove debian/watch (closes: #529154)
-- Ubuntu Archive Auto-Sync <email address hidden> Fri, 18 Dec 2009 17:43:02 +0000
Upload details
- Uploaded by:
- Ubuntu Archive Auto-Sync
- Uploaded to:
- Lucid
- Original maintainer:
- Juan Esteban Monsalve Tobon
- Architectures:
- any
- Section:
- math
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oneiric based series for Ubuntu LEB | release | universe | math |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| lp-solve_5.5.0.13.orig-docs.tar.gz | 369.6 KiB | 1d31b9b16f914372bc0e58c279fefabca279f3b665f21be8d83b418addd75509 |
| lp-solve_5.5.0.13.orig.tar.gz | 774.8 KiB | 8714793ffc227c5d78b83acc8e409a68f6159d83bcf0af632a69887c97fe4155 |
| lp-solve_5.5.0.13-7.debian.tar.gz | 8.9 KiB | 8d310fb4f08e62b2e96be176e8607ef70387ca69746f45489219afe8715a72b1 |
| lp-solve_5.5.0.13-7.dsc | 2.1 KiB | 4b53606f4b46259c136f0ec56154e452e5184b015e775fb7214a3e4fe5c016f2 |
Available diffs
- diff from 5.5.0.13-6 to 5.5.0.13-7 (702.6 KiB)
Binary packages built by this source
- liblpsolve55-dev: Solve (mixed integer) linear programming problems - library
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.
.
This package contains the static library for developing programs using
liblpsolve.
.
Homepage http://www.geocities. com/lpsolve/
- lp-solve: 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://www.geocities. com/lpsolve/
