balancedMul(const OsiBranchingInformation *info, int index, int wind) | Couenne::exprMultiLin | [protected] |
closestFeasible(expression *varind, expression *vardep, CouNumber &left, CouNumber &right) const | Couenne::exprMultiLin | [virtual] |
code() | Couenne::exprMultiLin | [inline, virtual] |
differentiate(int index) | Couenne::exprMultiLin | |
exprMultiLin(expression **, int) | Couenne::exprMultiLin | |
exprMultiLin(expression *, expression *) | Couenne::exprMultiLin | |
generateCuts(expression *w, OsiCuts &cs, const CouenneCutGenerator *cg, t_chg_bounds *=NULL, int=-1, CouNumber=-COUENNE_INFINITY, CouNumber=COUENNE_INFINITY) | Couenne::exprMultiLin | |
getBounds(expression *&, expression *&) | Couenne::exprMultiLin | [virtual] |
getBounds(CouNumber &lb, CouNumber &ub) | Couenne::exprMultiLin | [virtual] |
gradientNorm(const double *x) | Couenne::exprMultiLin | |
impliedBound(int, CouNumber *, CouNumber *, t_chg_bounds *, enum Couenne::expression::auxSign=Couenne::expression::AUX_EQ) | Couenne::exprMultiLin | |
impliedBoundMul(CouNumber wl, CouNumber wu, std::vector< CouNumber > &xl, std::vector< CouNumber > &xu, std::vector< std::pair< int, CouNumber > > &nl, std::vector< std::pair< int, CouNumber > > &nu) | Couenne::exprMultiLin | [protected] |
isCuttable(CouenneProblem *problem, int index) const | Couenne::exprMultiLin | [inline, protected, virtual] |
Linearity() | Couenne::exprMultiLin | [virtual] |
selectBranch(const CouenneObject *obj, const OsiBranchingInformation *info, expression *&var, double *&brpts, double *&brDist, int &way) | Couenne::exprMultiLin | [virtual] |
simplify() | Couenne::exprMultiLin | |
standardize(CouenneProblem *p, bool addAux=true) | Couenne::exprMultiLin | [virtual] |