How to Install and Uninstall coin-or-Bonmin.i686 Package on Fedora 39
Last updated: November 27,2024
1. Install "coin-or-Bonmin.i686" package
Learn how to install coin-or-Bonmin.i686 on Fedora 39
$
sudo dnf update
Copied
$
sudo dnf install
coin-or-Bonmin.i686
Copied
2. Uninstall "coin-or-Bonmin.i686" package
This is a short guide on how to uninstall coin-or-Bonmin.i686 on Fedora 39:
$
sudo dnf remove
coin-or-Bonmin.i686
Copied
$
sudo dnf autoremove
Copied
3. Information about the coin-or-Bonmin.i686 package on Fedora 39
Last metadata expiration check: 0:55:06 ago on Thu Mar 7 17:44:52 2024.
Available Packages
Name : coin-or-Bonmin
Version : 1.8.8
Release : 13.fc39
Architecture : i686
Size : 426 k
Source : coin-or-Bonmin-1.8.8-13.fc39.src.rpm
Repository : fedora
Summary : Basic Open-source Nonlinear Mixed INteger programming
URL : http://projects.coin-or.org/Bonmin
License : EPL-1.0
Description : Bonmin (Basic Open-source Nonlinear Mixed INteger programming) is an
: experimental open-source C++ code for solving general MINLP (Mixed Integer
: NonLinear Programming) problems of the form:
:
: min f(x)
:
: s.t. g_L <= g(x) <= g_U
: x_L <= x <= x_U
: x_i in Z for all i in I and,
: x_i in R for all i not in I.
:
: where f(x): R^n --> R, g(x): R^n --> R^m are twice continuously differentiable
: functions and I is a subset of {1,..,n}.
:
: Bonmin features several algorithms
:
: * B-BB is a NLP-based branch-and-bound algorithm,
: * B-OA is an outer-approximation decomposition algorithm,
: * B-QG is an implementation of Quesada and Grossmann's branch-and-cut
: algorithm,
: * B-Hyb is a hybrid outer-approximation based branch-and-cut algorithm.
:
: The algorithms in Bonmin are exact when the functions f and g are convex;
: in the case where f or g or both are non-convex they are heuristics.
Available Packages
Name : coin-or-Bonmin
Version : 1.8.8
Release : 13.fc39
Architecture : i686
Size : 426 k
Source : coin-or-Bonmin-1.8.8-13.fc39.src.rpm
Repository : fedora
Summary : Basic Open-source Nonlinear Mixed INteger programming
URL : http://projects.coin-or.org/Bonmin
License : EPL-1.0
Description : Bonmin (Basic Open-source Nonlinear Mixed INteger programming) is an
: experimental open-source C++ code for solving general MINLP (Mixed Integer
: NonLinear Programming) problems of the form:
:
: min f(x)
:
: s.t. g_L <= g(x) <= g_U
: x_L <= x <= x_U
: x_i in Z for all i in I and,
: x_i in R for all i not in I.
:
: where f(x): R^n --> R, g(x): R^n --> R^m are twice continuously differentiable
: functions and I is a subset of {1,..,n}.
:
: Bonmin features several algorithms
:
: * B-BB is a NLP-based branch-and-bound algorithm,
: * B-OA is an outer-approximation decomposition algorithm,
: * B-QG is an implementation of Quesada and Grossmann's branch-and-cut
: algorithm,
: * B-Hyb is a hybrid outer-approximation based branch-and-cut algorithm.
:
: The algorithms in Bonmin are exact when the functions f and g are convex;
: in the case where f or g or both are non-convex they are heuristics.