How to Install and Uninstall lrslib Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: May 17,2024

1. Install "lrslib" package

In this section, we are going to explain the necessary steps to install lrslib on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                lrslib
            
                    
    
    Copied

2. Uninstall "lrslib" package

This is a short guide on how to uninstall lrslib on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                lrslib
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the lrslib package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: lrslib
Priority: optional
Section: universe/math
Installed-Size: 435
Maintainer: Ubuntu Developers
Original-Maintainer: David Bremner
Architecture: amd64
Version: 0.51-2
Depends: libc6 (>= 2.14), libgmp10, liblrsgmp0 (>= 0.51)
Filename: pool/universe/l/lrslib/lrslib_0.51-2_amd64.deb
Size: 91108
MD5sum: 90091510ad3081d29ff6bab0f558ba4f
SHA1: 177066484d6e30ed4ff51d2c594be0e1fd524310
SHA256: c56d809146d26e78536e297f506c285f496c152f2c13d91ea0340cffdd519256
Description-en: package to enumerate vertices and extreme rays of a convex polyhedron
A convex polyhedron is the set of points satisfying a finite family
of linear inequalities. The study of the vertices and extreme rays
of such systems is important and useful in e.g. mathematics and
optimization. In a dual interpretation, finding the vertices of a
(bounded) polyhedron is equivalent to finding the convex hull
(bounding inequalities) of an (arbitrary dimensional) set of points.
Lrs (lexicographic reverse search) has two important features that
can be very important for certain applications: it works in exact
arithmetic, and it consumes memory proportional to the input, no
matter how large the output is.
Description-md5: bc62dafa0a5a501c68508823e5d8f398
Homepage: http://cgm.cs.mcgill.ca/~avis/C/lrs.html
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu