lp-solve 5.5.0.15-4build1 source package in Ubuntu

Changelog

lp-solve (5.5.0.15-4build1) artful; urgency=medium

  * No-change rebuild to pick up -fPIE compiler default in static
    libraries

 -- Steve Langasek <email address hidden>  Fri, 02 Jun 2017 22:31:19 +0000

Upload details

Uploaded by:
Steve Langasek
Uploaded to:
Artful
Original maintainer:
Juan Esteban Monsalve Tobon
Architectures:
any all
Section:
math
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Focal release main math
Bionic release main math

Downloads

File Size SHA-256 Checksum
lp-solve_5.5.0.15.orig-doc.tar.gz 1.4 MiB a9dcfa62148a283a6e11c0bb9524f4d5a4a4ecf06511e32cbd2faec04f791e17
lp-solve_5.5.0.15.orig.tar.gz 784.1 KiB ea1243e8aa2f0d52172dc0a90d1c2a8d2a4f696a39fc9cf07321810363d18985
lp-solve_5.5.0.15-4build1.debian.tar.xz 9.5 KiB c8d47e23c925e601669624e6b90f577596f4a5d534b71f31b5093621f6315469
lp-solve_5.5.0.15-4build1.dsc 2.2 KiB 54793e62079b91ae7e47a7a282650ec46740ed9881284efe0e5b39090ac7a267

View changes file

Binary packages built by this source

liblpsolve55-dev: No summary available for liblpsolve55-dev in ubuntu artful.

No description available for liblpsolve55-dev in ubuntu artful.

lp-solve: No summary available for lp-solve in ubuntu artful.

No description available for lp-solve in ubuntu artful.

lp-solve-dbgsym: No summary available for lp-solve-dbgsym in ubuntu artful.

No description available for lp-solve-dbgsym in ubuntu artful.

lp-solve-doc: Solve (mixed integer) linear programming problems - documentation

 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 documentation for the lp_solve program and
 the library.