Go to the documentation of this file.
11 #ifndef COUENNE_EXPRSIN_HPP
12 #define COUENNE_EXPRSIN_HPP
28 {
return a - b * floor (a/b);}
status of lower/upper bound of a variable, to be checked/modified in bound tightening
CouNumber(* unary_function)(CouNumber)
unary function, used in all exprUnary
CouExpr & sin(CouExpr &e)
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
expression * clone(Domain *d=NULL) const
cloning method
expression * argument_
single argument taken by this expression
void getBounds(expression *&, expression *&)
Get lower and upper bound of an expression (if any)
expr_type
code returned by the method expression::code()
expression class for unary functions (sin, log, etc.)
virtual bool isInteger()
is this expression integer?
Cut Generator for linear convexifications.
exprSin(expression *al)
Constructors, destructor.
general include file for different compilers
CouNumber gradientNorm(const double *x)
return l-2 norm of gradient at given point
bool trigImpliedBound(enum cou_trig, int, int, CouNumber *, CouNumber *, t_chg_bounds *)
generalized implied bound procedure for sine/cosine
std::string printOp() const
print operator
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 bool isCuttable(CouenneProblem *problem, int index) const
can this expression be further linearized or are we on its concave ("bad") side
OsiObject for auxiliary variables $w=f(x)$.
double CouNumber
main number type in Couenne
auxSign
"sign" of the constraint defining an auxiliary.
CouNumber modulo(register CouNumber a, register CouNumber b)
normalize angle within [0,b] (typically, pi or 2pi)
CouNumber trigSelBranch(const CouenneObject *obj, const OsiBranchingInformation *info, expression *&var, double *&brpts, double *&brDist, int &way, enum cou_trig type)
generalized procedure for both sine and cosine
virtual void closestFeasible(expression *varind, expression *vardep, CouNumber &left, CouNumber &right) const
closest feasible points in function in both directions
CouExpr & cos(CouExpr &e)
cou_trig
specify which trigonometric function is dealt with in trigEnvelope
bool impliedBound(int index, CouNumber *l, CouNumber *u, t_chg_bounds *chg, enum auxSign=expression::AUX_EQ)
implied bound processing
virtual enum expr_type code()
code for comparisons
Class for MINLP problems with symbolic information.
void getBounds(CouNumber &lb, CouNumber &ub)
Get value of lower and upper bound of an expression (if any)
unary_function F()
the operator itself (e.g. sin, log...)
virtual int Index() const
Return index of variable (only valid for exprVar and exprAux)
Define a dynamic point+bounds, with a way to save and restore previous points+bounds through a LIFO s...
expression * differentiate(int index)
differentiation