Fri, 20 Nov 2026 23:18:36 UTC Log in
Basic Open-source Nonlinear Mixed INteger programming 1.30 MB built 2026-10-13 06:55:13 GMT

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.

Dependencies

17 total
Requires14
  • asl-devel
  • coin-or-Cgl-doc
  • coin-or-Clp-doc
  • coin-or-Ipopt-common
  • doxygen-latex
  • gcc-c++
  • help2man
  • make
  • pkgconfig(cbc)
  • pkgconfig(ipopt)
  • rpmlib(CompressedFileNames) <= 3.0.4-1
  • rpmlib(FileDigests) <= 4.6.0-1
  • tex(tex4ht.sty)
  • tex(threeparttable.sty)
Provides3
  • coin-or-Bonmin = 1.8.9-8.fc45
  • coin-or-Bonmin-devel = 1.8.9-8.fc45
  • coin-or-Bonmin-doc = 1.8.9-8.fc45
ObsoletesNo Obsoletes
ConflictsNo Conflicts
RecommendsNo Recommends
SuggestsNo Suggests
SupplementsNo Supplements
EnhancesNo Enhances

Files

6
Files 1–6 of 6

Component of

buildroots that installed this RPM

No Buildroots