Go to the documentation of this file.
11 #ifndef COUENNE_EXPRFLOOR_HPP
12 #define COUENNE_EXPRFLOOR_HPP
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
expression * argument_
single argument taken by this expression
expr_type
code returned by the method expression::code()
virtual enum expr_type code()
code for comparisons
expression class for unary functions (sin, log, etc.)
virtual void closestFeasible(expression *varind, expression *vardep, CouNumber &left, CouNumber &right) const
closest feasible points in function in both directions
Cut Generator for linear convexifications.
void getBounds(expression *&, expression *&)
Get lower and upper bound of an expression (if any)
general include file for different compilers
expression * differentiate(int index)
obtain derivative of expression
OsiObject for auxiliary variables $w=f(x)$.
expression * clone(Domain *d=NULL) const
cloning method
unary_function F()
the operator itself (e.g. sin, log...)
double CouNumber
main number type in Couenne
auxSign
"sign" of the constraint defining an auxiliary.
bool impliedBound(int index, CouNumber *l, CouNumber *u, t_chg_bounds *chg, enum auxSign=expression::AUX_EQ)
implied bound processing
virtual bool isCuttable(CouenneProblem *problem, int index) const
can this expression be further linearized or are we on its concave ("bad") side?
void getBounds(CouNumber &lb, CouNumber &ub)
Get value of lower and upper bound of an expression.
std::string printOp() const
print operator
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
CouNumber gradientNorm(const double *x)
return l-2 norm of gradient at given point
Class for MINLP problems with symbolic information.
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.
exprFloor(expression *arg)
constructor, destructor
Define a dynamic point+bounds, with a way to save and restore previous points+bounds through a LIFO s...