compExpr | Structure for comparing expressions |
compNode | Structure for comparing nodes in the dependence graph |
CouenneAmplInterface | |
CouenneBranchingObject | "Spatial" branching object |
CouenneChooseStrong | |
CouenneChooseVariable | Choose a variable for branching |
CouenneComplBranchingObject | "Spatial" branching object for complementarity constraints |
CouenneComplObject | OsiObject for complementarity constraints $x_1 x_2 <=/>=/= 0$ |
CouenneConstraint | Class to represent nonlinear constraints |
CouenneCutGenerator | Cut Generator for linear convexifications |
CouenneDisjCuts | Cut Generator for linear convexifications |
Bonmin::CouenneInfo | Bonmin class for passing info between components of branch-and-cuts |
Bonmin::CouenneInfo::NlpSolution | Class for storing an Nlp Solution |
Bonmin::CouenneInterface | |
CouenneObject | OsiObject for auxiliary variables $w=f(x)$ |
CouenneObjective | Objective function |
CouenneOrbitBranchingObj | "Spatial" branching object |
CouenneOrbitObj | OsiObject for Orbital Branching |
CouenneOSInterface | |
CouenneProblem | Class for MINLP problems with symbolic information |
CouenneProblem::GlobalCutOff | Class for storing a global cutoff for a CouenneProblem and all its clones |
Bonmin::CouenneSetup | |
CouenneSolverInterface< T > | Solver interface class with a pointer to a Couenne cut generator |
CouenneSOSBranchingObject | |
CouenneSOSObject | |
CouenneThreeWayBranchObj | Spatial, three-way branching object |
CouenneUserInterface | |
CouenneVarObject | OsiObject for variables in a MINLP |
CouenneVTObject | OsiObject for violation transfer on variables in a MINLP |
CouExpr | |
DepGraph | Dependence graph |
DepNode | Vertex of a dependence graph |
Domain | Define a dynamic point+bounds, with a way to save and restore previous points+bounds through a LIFO structure |
DomainPoint | Define a point in the solution space and the bounds around it |
exprAbs | Class for ![]() |
exprAux | Auxiliary variable |
exprClone | Expression clone (points to another expression) |
exprConst | Constant-type operator |
exprCopy | |
exprCos | Class cosine |
exprDiv | Class for divisions |
expression | Expression base class |
exprExp | Class for the exponential |
exprGroup | Class Group, with constant, linear and nonlinear terms |
exprIf | |
exprInv | Class inverse (1/f(x)) |
exprIVar | Variable-type operator |
exprLBCos | Class to compute lower bound of a cosine based on the bounds of its arguments |
exprLBDiv | Class to compute lower bound of a fraction based on the bounds of both numerator and denominator |
exprLBMul | Class to compute lower bound of a product based on the bounds of both factors |
exprLBQuad | Class to compute lower bound of a fraction based on the bounds of both numerator and denominator |
exprLBSin | Class to compute lower bound of a sine based on the bounds on its arguments |
exprLog | Class logarithm |
exprLowerBound | Lower bound |
exprMax | Class for maxima |
exprMin | Class for minima |
exprMul | Class for multiplications |
exprNorm | |
exprOp | General n-ary operator-type expression: requires argument list |
exprOpp | Class opposite |
exprPow | Power of an expression (binary operator) |
exprPWLinear | |
exprQuad | Class exprQuad, with constant, linear and quadratic terms |
exprSin | Class for sin f(x) |
exprStore | Storage class for previously evaluated expressions |
exprSub | Class for subtraction |
exprSum | Class sum |
exprUBCos | Class to compute lower bound of a cosine based on the bounds of its arguments |
exprUBDiv | Class to compute upper bound of a fraction based on the bounds of both numerator and denominator |
exprUBMul | Class to compute upper bound of a product based on the bounds of both factors |
exprUBQuad | Class to compute upper bound of a fraction based on the bounds of both numerator and denominator |
exprUBSin | Class to compute lower bound of a sine based on the bounds on its arguments |
exprUnary | Expression class for unary functions (sin, log, etc |
exprUpperBound | Upper bound |
exprVar | Variable-type operator |
funtriplet | |
Bonmin::InitHeuristic | A heuristic that stores the initial solution of the NLP |
kpowertriplet | |
LinMap | |
Bonmin::NlpSolveHeuristic | |
powertriplet | |
Qroot | Class that stores result of previous calls to rootQ into a map for faster access |
quadElem | Name: lqelems.hpp Author: Pietro Belotti Purpose: definition of elemental elements of linear and bilinear expressions |
QuadMap | |
simpletriplet | |
Bonmin::SmartAsl | |
t_chg_bounds | Status of lower/upper bound of a variable, to be checked/modified in bound tightening |