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