class for
More...
#include <CouenneExprAbs.hpp>
Public Member Functions | |
| exprAbs (expression *al) | |
| Constructor. | |
| unary_function | F () |
| The operator's function. | |
| expression * | clone (Domain *d=NULL) const |
| cloning method | |
| std::string | printOp () const |
| output | |
| CouNumber | gradientNorm (const double *x) |
| return l_2 norm of gradient at given point | |
| expression * | differentiate (int index) |
| differentiation | |
| virtual void | getBounds (expression *&, expression *&) |
| Get lower and upper bound of an expression (if any). | |
| virtual void | getBounds (CouNumber &lb, CouNumber &ub) |
| Get value of lower and upper bound of an expression (if any). | |
| void | generateCuts (expression *w, OsiCuts &cs, const CouenneCutGenerator *cg, t_chg_bounds *=NULL, int=-1, CouNumber=-COUENNE_INFINITY, CouNumber=COUENNE_INFINITY) |
| generate equality between *this and *w | |
| enum expr_type | code () |
| code for comparisons | |
| bool | isInteger () |
| is this expression integer? | |
| bool | impliedBound (int, CouNumber *, CouNumber *, t_chg_bounds *, enum auxSign=expression::AUX_EQ) |
| implied bound processing | |
| virtual CouNumber | selectBranch (const CouenneObject *obj, const OsiBranchingInformation *info, expression *&var, double *&brpts, double *&brDist, int &way) |
| set up branching object by evaluating many branching points for each expression's arguments | |
| virtual void | closestFeasible (expression *varind, expression *vardep, CouNumber &left, CouNumber &right) const |
| closest feasible points in function in both directions | |
| virtual bool | isCuttable (CouenneProblem *problem, int index) const |
| can this expression be further linearized or are we on its concave ("bad") side | |
class for
Definition at line 23 of file CouenneExprAbs.hpp.
| Couenne::exprAbs::exprAbs | ( | expression * | al | ) | [inline] |
| unary_function Couenne::exprAbs::F | ( | ) | [inline, virtual] |
The operator's function.
Reimplemented from Couenne::exprUnary.
Definition at line 32 of file CouenneExprAbs.hpp.
| expression* Couenne::exprAbs::clone | ( | Domain * | d = NULL |
) | const [inline, virtual] |
cloning method
Reimplemented from Couenne::expression.
Definition at line 35 of file CouenneExprAbs.hpp.
References Couenne::exprUnary::argument_, and exprAbs().
| std::string Couenne::exprAbs::printOp | ( | ) | const [inline, virtual] |
| CouNumber Couenne::exprAbs::gradientNorm | ( | const double * | x | ) | [inline, virtual] |
return l_2 norm of gradient at given point
Reimplemented from Couenne::expression.
Definition at line 43 of file CouenneExprAbs.hpp.
References Couenne::exprUnary::argument_, and Couenne::expression::Index().
| expression* Couenne::exprAbs::differentiate | ( | int | index | ) | [virtual] |
differentiation
Reimplemented from Couenne::expression.
| virtual void Couenne::exprAbs::getBounds | ( | expression *& | , | |
| expression *& | ||||
| ) | [virtual] |
Get lower and upper bound of an expression (if any).
Get value of lower and upper bound of an expression (if any).
Reimplemented from Couenne::expression.
| void Couenne::exprAbs::generateCuts | ( | expression * | w, | |
| OsiCuts & | cs, | |||
| const CouenneCutGenerator * | cg, | |||
| t_chg_bounds * | = NULL, |
|||
| int | = -1, |
|||
| CouNumber | = -COUENNE_INFINITY, |
|||
| CouNumber | = COUENNE_INFINITY | |||
| ) |
generate equality between *this and *w
| enum expr_type Couenne::exprAbs::code | ( | ) | [inline, virtual] |
code for comparisons
Reimplemented from Couenne::exprUnary.
Definition at line 63 of file CouenneExprAbs.hpp.
References Couenne::COU_EXPRABS.
| bool Couenne::exprAbs::isInteger | ( | ) | [inline, virtual] |
is this expression integer?
Reimplemented from Couenne::exprUnary.
Definition at line 66 of file CouenneExprAbs.hpp.
References Couenne::exprUnary::argument_, and isInteger().
Referenced by isInteger().
| bool Couenne::exprAbs::impliedBound | ( | int | , | |
| CouNumber * | , | |||
| CouNumber * | , | |||
| t_chg_bounds * | , | |||
| enum | auxSign = expression::AUX_EQ | |||
| ) | [virtual] |
implied bound processing
Reimplemented from Couenne::expression.
| virtual CouNumber Couenne::exprAbs::selectBranch | ( | const CouenneObject * | obj, | |
| const OsiBranchingInformation * | info, | |||
| expression *& | var, | |||
| double *& | brpts, | |||
| double *& | brDist, | |||
| int & | way | |||
| ) | [virtual] |
set up branching object by evaluating many branching points for each expression's arguments
| virtual void Couenne::exprAbs::closestFeasible | ( | expression * | varind, | |
| expression * | vardep, | |||
| CouNumber & | left, | |||
| CouNumber & | right | |||
| ) | const [virtual] |
closest feasible points in function in both directions
| virtual bool Couenne::exprAbs::isCuttable | ( | CouenneProblem * | problem, | |
| int | index | |||
| ) | const [virtual] |
can this expression be further linearized or are we on its concave ("bad") side
Reimplemented from Couenne::expression.
1.6.1