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

Last updated: November 07,2024

1. Install "lp-solve-doc" package

In this section, we are going to explain the necessary steps to install lp-solve-doc on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                lp-solve-doc
            
                    
    
    Copied

2. Uninstall "lp-solve-doc" package

This is a short guide on how to uninstall lp-solve-doc on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                lp-solve-doc
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

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

Package: lp-solve-doc
Source: lp-solve
Version: 5.5.2.5-2
Installed-Size: 4575
Maintainer: Juan Esteban Monsalve Tobon
Architecture: all
Recommends: www-browser
Size: 1047904
SHA256: eeca0cf7c5c43f34df03f9306c067b929c96ec0472c6e6c554f6459a7b0242f4
SHA1: 3f6b2a16f39628ad483239b3d1c202cec2e268f1
MD5sum: b9ba3c62cb62c7ade9efdc65300d7e5f
Description: 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.
Description-md5:
Homepage: http://lpsolve.sourceforge.net
Tag: devel::doc, made-of::html, role::documentation
Section: doc
Priority: optional
Filename: pool/main/l/lp-solve/lp-solve-doc_5.5.2.5-2_all.deb