Complete Guide: Installing mplrs on Ubuntu 21.10 (Impish Indri) 2024

1. Install "mplrs" package

This guide let you learn how to install mplrs on Ubuntu 21.10 (Impish Indri)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                mplrs
            
                    
    
    Copied

2. Uninstall "mplrs" package

In this section, we are going to explain the necessary steps to uninstall mplrs on Ubuntu 21.10 (Impish Indri):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                mplrs
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the mplrs package on Ubuntu 21.10 (Impish Indri)

Package: mplrs
Architecture: amd64
Version: 0.71a-1
Priority: optional
Section: universe/math
Source: lrslib
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: David Bremner
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 299
Depends: libc6 (>= 2.14), libgmp10, libopenmpi3 (>= 4.0.3)
Filename: pool/universe/l/lrslib/mplrs_0.71a-1_amd64.deb
Size: 109632
MD5sum: 60b27947bd2e7785d2399e09f0e10d03
SHA1: 30fefd55aab361bea0a255eb8c708e4943f84195
SHA256: 1d7d515d2d564cea93c47eaeb08ad64c41816723b6999746aed894a13ffe7ce5
SHA512: 15e62566a2e2e12a8cb80db599d622f14e2a82194b263bc309964cd928410e333aec16fb320271fee6e37ab47d07dfeff313f9db525e6a455e659ab92e51fc6a
Homepage: http://cgm.cs.mcgill.ca/~avis/C/lrs.html
Description-en: package to enumerate vertices and extreme rays of a convex polyhedron (parallel binary)
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 parallel binary mplrs for use with mpi
Description-md5: 9b219c9d8ebd440990a343391818c4b6