How to Install and Uninstall lp-solve Package on Kali Linux

Last updated: September 20,2024

1. Install "lp-solve" package

Please follow the guidelines below to install lp-solve on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                lp-solve
            
                    
    
    Copied

2. Uninstall "lp-solve" package

Please follow the steps below to uninstall lp-solve on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                lp-solve
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the lp-solve package on Kali Linux

Package: lp-solve
Source: lp-solve (5.5.2.5-2)
Version: 5.5.2.5-2+b1
Installed-Size: 690
Maintainer: Juan Esteban Monsalve Tobon
Architecture: amd64
Depends: libc6 (>= 2.34), libcolamd3 (>= 1:7.0.1)
Size: 293188
SHA256: 7e2a975ddee39ad8f7c9021d537f2689cba2b6b2665d37b6a0fd52ca039882b8
SHA1: bbb53044fdfdd93f032c2c75902a4c5d6653be8f
MD5sum: ef7ca783a1aa7cec703293e6225a5e91
Description: 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:
Homepage: http://lpsolve.sourceforge.net
Tag: field::mathematics, role::program, scope::application
Section: math
Priority: optional
Filename: pool/main/l/lp-solve/lp-solve_5.5.2.5-2+b1_amd64.deb