11 #ifndef COUENNE_EXPRCOS_HPP
12 #define COUENNE_EXPRCOS_HPP
85 const OsiBranchingInformation *info,
Cut Generator for linear convexifications.
exprCos(expression *al)
constructor, destructor
OsiObject for auxiliary variables $w=f(x)$.
std::string printOp() const
print operator
status of lower/upper bound of a variable, to be checked/modified in bound tightening ...
virtual bool isInteger()
is this expression integer?
virtual enum expr_type code()
code for comparisons
bool impliedBound(int index, CouNumber *l, CouNumber *u, t_chg_bounds *chg, enum auxSign=expression::AUX_EQ)
implied bound processing
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
expression * argument_
single argument taken by this expression
bool trigImpliedBound(enum cou_trig, int, int, CouNumber *, CouNumber *, t_chg_bounds *)
generalized implied bound procedure for sine/cosine
expression class for unary functions (sin, log, etc.)
unary_function F()
the operator itself (e.g. sin, log...)
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
virtual int Index() const
Return index of variable (only valid for exprVar and exprAux)
auxSign
"sign" of the constraint defining an auxiliary.
expression * clone(Domain *d=NULL) const
cloning method
CouNumber(* unary_function)(CouNumber)
unary function, used in all exprUnary
CouNumber gradientNorm(const double *x)
return l-2 norm of gradient at given point
virtual bool isCuttable(CouenneProblem *problem, int index) const
can this expression be further linearized or are we on its concave ("bad") side
Class for MINLP problems with symbolic information.
double CouNumber
main number type in Couenne
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...
CouNumber trigNewton(CouNumber, CouNumber, CouNumber)
common convexification method used by both cos and sin
expr_type
code returned by the method expression::code()
virtual void closestFeasible(expression *varind, expression *vardep, CouNumber &left, CouNumber &right) const
closest feasible points in function in both directions
CouExpr & cos(CouExpr &e)
expression * differentiate(int index)
obtain derivative of expression
CouExpr & sin(CouExpr &e)
void getBounds(expression *&, expression *&)
Get lower and upper bound of an expression (if any)
Define a dynamic point+bounds, with a way to save and restore previous points+bounds through a LIFO s...