How to Install and Uninstall lp-solve-doc Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: November 22,2024

1. Install "lp-solve-doc" package

Please follow the instructions below to install lp-solve-doc on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                lp-solve-doc
            
                    
    
    Copied

2. Uninstall "lp-solve-doc" package

Please follow the instructions below to uninstall lp-solve-doc on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                lp-solve-doc
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the lp-solve-doc package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: lp-solve-doc
Priority: optional
Section: doc
Installed-Size: 2071
Maintainer: Ubuntu Developers
Original-Maintainer: Juan Esteban Monsalve Tobon
Architecture: all
Source: lp-solve
Version: 5.5.0.13-7build2
Recommends: www-browser
Filename: pool/main/l/lp-solve/lp-solve-doc_5.5.0.13-7build2_all.deb
Size: 223728
MD5sum: e81e0cebe0e19864ec241ec7a1555456
SHA1: 597756f2c3fc55a0a03f1411c6e7021ed4a3729f
SHA256: ca76f8a25471c19de30d37a228c54965aae1e47d101ea557a13e83470f9d4046
Description-en: 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.
.
Homepage http://www.geocities.com/lpsolve/
Description-md5: 1671ede7b2bbfb59f742e21455517124
Homepage: http://lpsolve.sourceforge.net
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu
Supported: 9m