Ubuntu
lp-solve package

lp-solve 5.5.2.11-2ubuntu1 source package in Ubuntu

Changelog

lp-solve (5.5.2.11-2ubuntu1) oracular; urgency=medium

  * Merge with debian unstable (LP: #2078715). Remaining changes:
    - d/p/11_ccc_cflags: Recognize cflags in custom 'ccc' build script
    - d/rules: export CFLAGS from dpkg-buildflags

lp-solve (5.5.2.11-2) unstable; urgency=medium

  * upload to unstable

lp-solve (5.5.2.11-1) experimental; urgency=medium

  * "New" upstream release (closes: #1008073)
    - does not hardode /tmp anymore in ccc (closes: #875335)

lp-solve (5.5.2.5-3) unstable; urgency=medium

  * debian/patches/10_int_main.diff: add int to main() echos in ccc to
    fix build with gcc 14 (closes: #1075236)
  * debian/warch: add, from #1008073

 -- Alessandro Astone <email address hidden>  Fri, 23 Aug 2024 12:50:26 +0200

Upload details

Uploaded by:
Alessandro Astone
Sponsored by:
Vladimir Petko
Uploaded to:
Oracular
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
math
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Plucky release main math
Oracular release main math

Downloads

File Size SHA-256 Checksum
lp-solve_5.5.2.11.orig-doc.tar.gz 989.0 KiB 3d71bf1d03ee5150f0a33881694cb407480cd8fa98b6abf1a24eac0464526b80
lp-solve_5.5.2.11.orig.tar.gz 543.5 KiB 6d4abff5cc6aaa933ae8e6c17a226df0fc0b671c438f69715d41d09fe81f902f
lp-solve_5.5.2.11-2ubuntu1.debian.tar.xz 16.8 KiB 2c9f6cd0a0067f64cee6ece67ccc5a945fe0b12471e9c6f2c15592ecd250a359
lp-solve_5.5.2.11-2ubuntu1.dsc 2.3 KiB 5afdafcdd228e151ca8ab8fbf8f3c07888e05edd14b4a1e6427419367c059819

View changes file

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.

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.

lp-solve-dbgsym: debug symbols for lp-solve
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.