How to Install and Uninstall liblrs-dev Package on Ubuntu 21.10 (Impish Indri)

Last updated: May 15,2024

1. Install "liblrs-dev" package

This tutorial shows how to install liblrs-dev on Ubuntu 21.10 (Impish Indri)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                liblrs-dev
            
                    
    
    Copied

2. Uninstall "liblrs-dev" package

This guide let you learn how to uninstall liblrs-dev on Ubuntu 21.10 (Impish Indri):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                liblrs-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the liblrs-dev package on Ubuntu 21.10 (Impish Indri)

Package: liblrs-dev
Architecture: amd64
Version: 0.71a-1
Priority: optional
Section: universe/libdevel
Source: lrslib
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: David Bremner
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 79
Depends: liblrs1 (= 0.71a-1)
Breaks: liblrsgmp-dev (<< 0.70)
Replaces: liblrsgmp-dev (<< 0.70)
Filename: pool/universe/l/lrslib/liblrs-dev_0.71a-1_amd64.deb
Size: 14088
MD5sum: ba10004453e0bf87c53677e3b6b43773
SHA1: 02b9d1ac1f6a9482d38494f024bbf0273d19e850
SHA256: e0c5856400243efa9e3c283ac87fcd3e59c3f650c8d8d4cf7213c91c888da66f
SHA512: 1662584aa0ff02c13671afd0045dc911f5f0d9ea32b6ec3cbba6425e410af5e821d75989f8f4cacdd659643f9cbe568c31a69f81289525a28e8fe82c50742f66
Homepage: http://cgm.cs.mcgill.ca/~avis/C/lrs.html
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