Ubuntu
lp-solve package

lp-solve 5.5.2.5-2build3 source package in Ubuntu

Changelog

lp-solve (5.5.2.5-2build3) mantic; urgency=medium

  * No-change rebuild against libcolamd3

 -- Graham Inggs <email address hidden>  Mon, 14 Aug 2023 14:16:22 +0000

Upload details

Uploaded by:
Graham Inggs
Uploaded to:
Mantic
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
math
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Mantic release main math

Downloads

File Size SHA-256 Checksum
lp-solve_5.5.2.5.orig-doc.tar.gz 1.4 MiB 4c6085a7083cca04c18876a1c8838ae2427b97080219fffedde1c3a96bc13561
lp-solve_5.5.2.5.orig.tar.gz 793.9 KiB 201a7c62b8b3360c884ee2a73ed7667e5716fc1e809755053b398c2f5b0cf28a
lp-solve_5.5.2.5-2build3.debian.tar.xz 16.2 KiB 8db4feeb55261cbc66baa4538917157c39f27d80d2fa47d8bea40eb5bdbfcb8b
lp-solve_5.5.2.5-2build3.dsc 2.3 KiB 8aadfbc4e524116b1bc8c4e39e6fa7145ea7d395abea14d9dc6feeb9eede4049

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.