How to Install and Uninstall lp-solve Package on Ubuntu 21.10 (Impish Indri)
Last updated: November 07,2024
1. Install "lp-solve" package
Please follow the steps below to install lp-solve on Ubuntu 21.10 (Impish Indri)
$
sudo apt update
Copied
$
sudo apt install
lp-solve
Copied
2. Uninstall "lp-solve" package
In this section, we are going to explain the necessary steps to uninstall lp-solve on Ubuntu 21.10 (Impish Indri):
$
sudo apt remove
lp-solve
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the lp-solve package on Ubuntu 21.10 (Impish Indri)
Package: lp-solve
Architecture: amd64
Version: 5.5.2.5-2build1
Priority: optional
Section: math
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Juan Esteban Monsalve Tobon
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 700
Depends: libc6 (>= 2.34), libcolamd2 (>= 1:4.5.2)
Filename: pool/main/l/lp-solve/lp-solve_5.5.2.5-2build1_amd64.deb
Size: 315100
MD5sum: 5de13a24392445b1bc9583d95a35a83e
SHA1: b6365b3212a470a0a0320925984977279126c368
SHA256: e1c8ded3006495ef677c19427033dead7e12566dd9d2b0f71be1fbe65a8551d0
SHA512: ba2fdd0cc8d9c31e24ba0c3233c07d3d444631196fc74f249813c862b81761403e101379f580867d6ecfe04673683786e1bcf6ce23a5f923b13d0a7c310bd002
Homepage: http://lpsolve.sourceforge.net
Description-en: 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.
Description-md5: 0cf1973d14c9916f985920235dcabc27
Task: ubuntu-desktop, ubuntu-desktop-raspi, kubuntu-desktop, kubuntu-full, xubuntu-desktop, lubuntu-desktop, ubuntustudio-desktop, ubuntukylin-desktop, ubuntu-mate-desktop, ubuntu-budgie-desktop, ubuntu-budgie-desktop-raspi
Architecture: amd64
Version: 5.5.2.5-2build1
Priority: optional
Section: math
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Juan Esteban Monsalve Tobon
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 700
Depends: libc6 (>= 2.34), libcolamd2 (>= 1:4.5.2)
Filename: pool/main/l/lp-solve/lp-solve_5.5.2.5-2build1_amd64.deb
Size: 315100
MD5sum: 5de13a24392445b1bc9583d95a35a83e
SHA1: b6365b3212a470a0a0320925984977279126c368
SHA256: e1c8ded3006495ef677c19427033dead7e12566dd9d2b0f71be1fbe65a8551d0
SHA512: ba2fdd0cc8d9c31e24ba0c3233c07d3d444631196fc74f249813c862b81761403e101379f580867d6ecfe04673683786e1bcf6ce23a5f923b13d0a7c310bd002
Homepage: http://lpsolve.sourceforge.net
Description-en: 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.
Description-md5: 0cf1973d14c9916f985920235dcabc27
Task: ubuntu-desktop, ubuntu-desktop-raspi, kubuntu-desktop, kubuntu-full, xubuntu-desktop, lubuntu-desktop, ubuntustudio-desktop, ubuntukylin-desktop, ubuntu-mate-desktop, ubuntu-budgie-desktop, ubuntu-budgie-desktop-raspi