How to Install and Uninstall liblpsolve55-dev Package on Ubuntu 21.10 (Impish Indri)
Last updated: November 07,2024
1. Install "liblpsolve55-dev" package
Please follow the guidance below to install liblpsolve55-dev on Ubuntu 21.10 (Impish Indri)
$
sudo apt update
Copied
$
sudo apt install
liblpsolve55-dev
Copied
2. Uninstall "liblpsolve55-dev" package
This guide let you learn how to uninstall liblpsolve55-dev on Ubuntu 21.10 (Impish Indri):
$
sudo apt remove
liblpsolve55-dev
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the liblpsolve55-dev package on Ubuntu 21.10 (Impish Indri)
Package: liblpsolve55-dev
Architecture: amd64
Version: 5.5.2.5-2build1
Priority: optional
Section: math
Source: lp-solve
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Juan Esteban Monsalve Tobon
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 2177
Depends: libsuitesparse-dev
Filename: pool/main/l/lp-solve/liblpsolve55-dev_5.5.2.5-2build1_amd64.deb
Size: 466974
MD5sum: 3813918ad58155bd346567e1b946aacc
SHA1: 5276e9d12236927372c73e734c1bf55aa2ba44fa
SHA256: 2065f1f6e85d3fe6e38f42164a6967f2c953be8339199f710f3fb64f26feb869
SHA512: 86348d00ca307584da0c91f614193c921ff131ee35dbdbe72e133dad45f7eca3dcc522adc24eedff49cff03aa121c9a715af674b650d0e3f2e19a64c617ea4da
Homepage: http://lpsolve.sourceforge.net
Description-en: 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.
Description-md5: 83ab2a5569e8e5aa48dc0c181dbcf28e
Architecture: amd64
Version: 5.5.2.5-2build1
Priority: optional
Section: math
Source: lp-solve
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Juan Esteban Monsalve Tobon
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 2177
Depends: libsuitesparse-dev
Filename: pool/main/l/lp-solve/liblpsolve55-dev_5.5.2.5-2build1_amd64.deb
Size: 466974
MD5sum: 3813918ad58155bd346567e1b946aacc
SHA1: 5276e9d12236927372c73e734c1bf55aa2ba44fa
SHA256: 2065f1f6e85d3fe6e38f42164a6967f2c953be8339199f710f3fb64f26feb869
SHA512: 86348d00ca307584da0c91f614193c921ff131ee35dbdbe72e133dad45f7eca3dcc522adc24eedff49cff03aa121c9a715af674b650d0e3f2e19a64c617ea4da
Homepage: http://lpsolve.sourceforge.net
Description-en: 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.
Description-md5: 83ab2a5569e8e5aa48dc0c181dbcf28e