How to Install and Uninstall cddlib.i686 Package on Fedora 36

Last updated: September 29,2024

1. Install "cddlib.i686" package

Please follow the steps below to install cddlib.i686 on Fedora 36


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                cddlib.i686
            
                    
    
    Copied

2. Uninstall "cddlib.i686" package

This is a short guide on how to uninstall cddlib.i686 on Fedora 36:


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                cddlib.i686
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the cddlib.i686 package on Fedora 36

Last metadata expiration check: 5:15:38 ago on Thu Sep 8 08:04:50 2022.
Available Packages
Name : cddlib
Epoch : 1
Version : 0.94m
Release : 3.fc36
Architecture : i686
Size : 163 k
Source : cddlib-0.94m-3.fc36.src.rpm
Repository : fedora
Summary : A library for generating all vertices in convex polyhedrons
URL : https://www.inf.ethz.ch/personal/fukudak/cdd_home/
License : GPLv2+
Description : The C-library cddlib is a C implementation of the Double Description
: Method of Motzkin et al. for generating all vertices (i.e. extreme points)
: and extreme rays of a general convex polyhedron in R^d given by a system
: of linear inequalities:
:
: P = { x=(x1, ..., xd)^T : b - A x >= 0 }
:
: where A is a given m x d real matrix, b is a given m-vector
: and 0 is the m-vector of all zeros.
:
: The program can be used for the reverse operation (i.e. convex hull
: computation). This means that one can move back and forth between
: an inequality representation and a generator (i.e. vertex and ray)
: representation of a polyhedron with cdd. Also, cdd can solve a linear
: programming problem, i.e. a problem of maximizing and minimizing
: a linear function over P.