How to Install and Uninstall cddlib.x86_64 Package on Fedora 38
Last updated: November 27,2024
1. Install "cddlib.x86_64" package
Please follow the guidance below to install cddlib.x86_64 on Fedora 38
$
sudo dnf update
Copied
$
sudo dnf install
cddlib.x86_64
Copied
2. Uninstall "cddlib.x86_64" package
This is a short guide on how to uninstall cddlib.x86_64 on Fedora 38:
$
sudo dnf remove
cddlib.x86_64
Copied
$
sudo dnf autoremove
Copied
3. Information about the cddlib.x86_64 package on Fedora 38
Last metadata expiration check: 3:41:25 ago on Sat Mar 16 22:59:57 2024.
Available Packages
Name : cddlib
Epoch : 1
Version : 0.94m
Release : 6.fc38
Architecture : x86_64
Size : 146 k
Source : cddlib-0.94m-6.fc38.src.rpm
Repository : fedora
Summary : A library for generating all vertices in convex polyhedrons
URL : https://people.inf.ethz.ch/fukudak/cdd_home/
License : GPL-2.0-or-later
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×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.
Available Packages
Name : cddlib
Epoch : 1
Version : 0.94m
Release : 6.fc38
Architecture : x86_64
Size : 146 k
Source : cddlib-0.94m-6.fc38.src.rpm
Repository : fedora
Summary : A library for generating all vertices in convex polyhedrons
URL : https://people.inf.ethz.ch/fukudak/cdd_home/
License : GPL-2.0-or-later
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×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.