11#ifndef COUENNE_EXPRVAR_HPP
12#define COUENNE_EXPRVAR_HPP
23 template <
class T>
class SmartPtr;
73 {
return new exprVar (*
this, d);}
88 virtual void print (std::ostream &out = std::cout,
106 virtual inline int DepList (std::set <int> &deplist,
109 if (deplist.find (
varIndex_) == deplist.end ()) {
Cut Generator for linear convexifications.
OsiObject for auxiliary variables $w=f(x)$.
Class for MINLP problems with symbolic information.
Define a dynamic point+bounds, with a way to save and restore previous points+bounds through a LIFO s...
virtual bool isInteger()
is this variable integer?
virtual CouNumber gradientNorm(const double *x)
return l-2 norm of gradient at given point
virtual void getBounds(expression *&, expression *&)
Get expressions of lower and upper bound of an expression (if any)
virtual void decreaseMult()
virtual enum nodeType Type() const
Node type.
virtual expression * Lb()
Get lower bound expression.
virtual CouNumber & ub()
Get/set upper bound value.
int varIndex_
The index of the variable.
virtual expression * simplify()
simplify
virtual enum auxSign sign() const
return its sign in the definition constraint
virtual exprVar * clone(Domain *d=NULL) const
Cloning method.
virtual bool isDefinedInteger()
is this expression defined as an integer?
virtual enum convexity convexity() const
either CONVEX, CONCAVE, AFFINE, or NONCONVEX
virtual void generateCuts(expression *w, OsiCuts &cs, const CouenneCutGenerator *cg, t_chg_bounds *=NULL, int=-1, CouNumber=-COUENNE_INFINITY, CouNumber=COUENNE_INFINITY)
generate convexification cut for constraint w = this
virtual void crossBounds()
set bounds depending on both branching rules and propagated bounds.
virtual CouNumber & lb()
Get/set lower bound value.
virtual enum expr_type code()
code for comparison
virtual void linkDomain(Domain *d)
link this variable to a domain
virtual bool isFixed()
is this variable fixed?
virtual void zeroMult()
Disable variable (empty for compatibility with exprAux)
exprVar(const exprVar &e, Domain *d=NULL)
Copy constructor.
int Index() const
Get variable index in problem.
virtual void fillDepSet(std::set< DepNode *, compNode > *, DepGraph *)
update dependence set with index of this variable
virtual int Linearity()
get a measure of "how linear" the expression is (see CouenneTypes.hpp)
virtual void print(std::ostream &out=std::cout, bool=false) const
print
virtual int rank()
rank of an original variable is always one
virtual void generateCuts(OsiCuts &, const CouenneCutGenerator *, t_chg_bounds *=NULL, int=-1, CouNumber=-COUENNE_INFINITY, CouNumber=COUENNE_INFINITY)
Get values of lower and upper bound of an expression (if any)
virtual void setInteger(bool value)
Set this variable as integer (empty for compatibility with exprAux)
virtual expression * Ub()
Get upper bound expression.
virtual CouNumber operator()()
return the value of the variable
virtual expression * differentiate(int index)
differentiation
virtual void getBounds(CouNumber &lb, CouNumber &ub)
Get value of lower and upper bound of an expression (if any)
exprVar(int varIndex, Domain *d=NULL)
Constructor.
Domain * domain_
Pointer to a descriptor of the current point/bounds.
virtual int DepList(std::set< int > &deplist, enum dig_type type=ORIG_ONLY)
fill in the set with all indices of variables appearing in the expression
virtual Domain * domain()
return pointer to variable domain
virtual bool impliedBound(int, CouNumber *, CouNumber *, t_chg_bounds *, enum auxSign=expression::AUX_EQ)
implied bound processing
virtual CouenneObject * properObject(CouenneCutGenerator *c, CouenneProblem *p, Bonmin::BabSetupBase *base, JnlstPtr jnlst_)
return proper object to handle expression associated with this variable (NULL if this is not an auxil...
virtual ~exprVar()
destructor
auxSign
"sign" of the constraint defining an auxiliary.
status of lower/upper bound of a variable, to be checked/modified in bound tightening
general include file for different compilers
nodeType
type of a node in an expression tree
Ipopt::SmartPtr< Ipopt::Journalist > JnlstPtr
dig_type
type of digging when filling the dependence list
double CouNumber
main number type in Couenne
Ipopt::SmartPtr< const Ipopt::Journalist > ConstJnlstPtr
convexity
convexity type of an expression
expr_type
code returned by the method expression::code()