How to Install and Uninstall liblrsgmp-dev Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: May 19,2024

1. Install "liblrsgmp-dev" package

Please follow the guidelines below to install liblrsgmp-dev on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                liblrsgmp-dev
            
                    
    
    Copied

2. Uninstall "liblrsgmp-dev" package

This tutorial shows how to uninstall liblrsgmp-dev on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                liblrsgmp-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the liblrsgmp-dev package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: liblrsgmp-dev
Priority: optional
Section: universe/libdevel
Installed-Size: 61
Maintainer: Ubuntu Developers
Original-Maintainer: David Bremner
Architecture: amd64
Source: lrslib
Version: 0.51-2
Replaces: liblrs-dev (<< 0.51~)
Depends: liblrsgmp0 (= 0.51-2)
Breaks: liblrs-dev (<< 0.51~)
Filename: pool/universe/l/lrslib/liblrsgmp-dev_0.51-2_amd64.deb
Size: 9434
MD5sum: 42e2f4836715f239d564f8aa36fa68b7
SHA1: 3e0b47b64a72d4e1d4af4d1eff506656497e8a3c
SHA256: 8e32770e28bccccc24f6c63ba309c87ab306c3090641f553dc91f96f21a94f27
Description-en: package to enumerate vertices and extreme rays (development file)
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.
.
This package contains the optional headers, and a unversioned symlink
to the library, useful for developers.
Description-md5: 5d0168d74b6acf76565022e34c5a9fa9
Homepage: http://cgm.cs.mcgill.ca/~avis/C/lrs.html
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu