Couenne 0.5.8
Loading...
Searching...
No Matches
Couenne::exprLowerBound Class Reference

These are bound expression classes. More...

#include <CouenneExprBound.hpp>

+ Inheritance diagram for Couenne::exprLowerBound:
+ Collaboration diagram for Couenne::exprLowerBound:

Public Member Functions

enum nodeType Type () const
 Node type.
 
 exprLowerBound (int varIndex, Domain *d=NULL)
 Constructor.
 
 exprLowerBound (const exprLowerBound &src, Domain *d=NULL)
 Copy constructor.
 
exprLowerBoundclone (Domain *d=NULL) const
 cloning method
 
void print (std::ostream &out=std::cout, bool=false) const
 Print to iostream.
 
CouNumber operator() ()
 return the value of the variable
 
expressiondifferentiate (int)
 differentiation
 
int dependsOn (int *, int, enum dig_type type=STOP_AT_AUX)
 dependence on variable set
 
virtual int Linearity ()
 get a measure of "how linear" the expression is:
 
virtual enum expr_type code ()
 code for comparisons
 
- Public Member Functions inherited from Couenne::exprVar
 exprVar (int varIndex, Domain *d=NULL)
 Constructor.
 
virtual ~exprVar ()
 destructor
 
 exprVar (const exprVar &e, Domain *d=NULL)
 Copy constructor.
 
int Index () const
 Get variable index in problem.
 
virtual expressionLb ()
 Get lower bound expression.
 
virtual expressionUb ()
 Get upper bound expression.
 
virtual CouNumberlb ()
 Get/set lower bound value.
 
virtual CouNumberub ()
 Get/set upper bound value.
 
virtual CouNumber gradientNorm (const double *x)
 return l-2 norm of gradient at given point
 
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 void crossBounds ()
 set bounds depending on both branching rules and propagated bounds.
 
virtual expressionsimplify ()
 simplify
 
virtual bool isDefinedInteger ()
 is this expression defined as an integer?
 
virtual bool isInteger ()
 is this variable integer?
 
virtual void getBounds (expression *&, expression *&)
 Get expressions of lower and upper bound of an expression (if any)
 
virtual void getBounds (CouNumber &lb, CouNumber &ub)
 Get value of lower and upper bound of an expression (if any)
 
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 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 bool impliedBound (int, CouNumber *, CouNumber *, t_chg_bounds *, enum auxSign=expression::AUX_EQ)
 implied bound processing
 
virtual int rank ()
 rank of an original variable is always one
 
virtual void fillDepSet (std::set< DepNode *, compNode > *, DepGraph *)
 update dependence set with index of this variable
 
virtual bool isFixed ()
 is this variable fixed?
 
virtual void linkDomain (Domain *d)
 link this variable to a domain
 
virtual Domaindomain ()
 return pointer to variable domain
 
virtual void decreaseMult ()
 
virtual void zeroMult ()
 Disable variable (empty for compatibility with exprAux)
 
virtual void setInteger (bool value)
 Set this variable as integer (empty for compatibility with exprAux)
 
virtual enum convexity convexity () const
 either CONVEX, CONCAVE, AFFINE, or NONCONVEX
 
virtual CouenneObjectproperObject (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 auxiliary)
 
virtual enum auxSign sign () const
 return its sign in the definition constraint
 
- Public Member Functions inherited from Couenne::expression
 expression ()
 Constructor.
 
 expression (const expression &e, Domain *d=NULL)
 Copy constructor.
 
virtual ~expression ()
 Destructor.
 
virtual int nArgs () const
 return number of arguments (when applicable, that is, with N-ary functions)
 
virtual expression ** ArgList () const
 return arglist (when applicable, that is, with N-ary functions)
 
virtual void ArgList (expression **al)
 set arglist (used in deleting nodes without deleting children)
 
virtual expressionArgument () const
 return argument (when applicable, i.e., with univariate functions)
 
virtual expression ** ArgPtr ()
 return pointer to argument (when applicable, i.e., with univariate functions)
 
virtual expressionImage () const
 return pointer to corresponding expression (for auxiliary variables only)
 
virtual void Image (expression *image)
 set expression associated with this auxiliary variable (for compatibility with exprAux)
 
virtual CouNumber Value () const
 value (empty)
 
virtual const expressionOriginal () const
 If this is an exprClone of a exprClone of an expr???, point to the original expr??? instead of an exprClone – improve computing efficiency.
 
int dependsOn (int singleton, enum dig_type type=STOP_AT_AUX)
 version with one index only
 
virtual exprAuxstandardize (CouenneProblem *p, bool addAux=true)
 Create standard form of this expression, by:
 
virtual int compare (expression &)
 compare expressions
 
virtual int compare (exprCopy &)
 compare copies of expressions
 
virtual int Multiplicity ()
 multiplicity of a variable
 
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 replace (exprVar *, exprVar *)
 replace expression with another
 
virtual void realign (const CouenneProblem *p)
 empty function to redirect variables to proper variable vector
 
virtual bool isBijective () const
 indicating if function is monotonically increasing
 
virtual CouNumber inverse (expression *vardep) const
 compute the inverse function
 
virtual void closestFeasible (expression *varind, expression *vardep, CouNumber &left, CouNumber &right) const
 closest feasible points in function in both directions
 
virtual bool isCuttable (CouenneProblem *problem, int index) const
 can this expression be further linearized or are we on its concave ("bad") side
 
virtual bool isaCopy () const
 return true if this is a copy of something (i.e. an exprCopy)
 
virtual expressionCopy () const
 return copy of this expression (only makes sense in exprCopy)
 

Additional Inherited Members

- Public Types inherited from Couenne::expression
enum  auxSign { AUX_UNDEF =-2 , AUX_LEQ =-1 , AUX_EQ , AUX_GEQ }
 "sign" of the constraint defining an auxiliary. More...
 
- Protected Attributes inherited from Couenne::exprVar
int varIndex_
 The index of the variable.
 
Domaindomain_
 Pointer to a descriptor of the current point/bounds.
 

Detailed Description

These are bound expression classes.

They are used in the parametric convexification part to obtain lower/upper bounds of an expression as a function of the expression itself.

For example, the lower and upper bounds to expression (x1 - exp (x2)) are (l1 - exp (u2)) and (u1 - exp (l2)), respectively, where l1 (l2) is the lower bound of x1 (x2) and u1 (u2) is the upper bound of x1 (x2).

A lower/upper bound of an expression is a function of all bounds in the expression and is known only when all variables bounds are known. lower bound

Definition at line 38 of file CouenneExprBound.hpp.

Constructor & Destructor Documentation

◆ exprLowerBound() [1/2]

Couenne::exprLowerBound::exprLowerBound ( int varIndex,
Domain * d = NULL )
inline

Constructor.

Definition at line 47 of file CouenneExprBound.hpp.

◆ exprLowerBound() [2/2]

Couenne::exprLowerBound::exprLowerBound ( const exprLowerBound & src,
Domain * d = NULL )
inline

Copy constructor.

Definition at line 51 of file CouenneExprBound.hpp.

Member Function Documentation

◆ Type()

enum nodeType Couenne::exprLowerBound::Type ( ) const
inlinevirtual

Node type.

Reimplemented from Couenne::exprVar.

Definition at line 43 of file CouenneExprBound.hpp.

◆ clone()

exprLowerBound * Couenne::exprLowerBound::clone ( Domain * d = NULL) const
inlinevirtual

cloning method

Reimplemented from Couenne::exprVar.

Definition at line 55 of file CouenneExprBound.hpp.

◆ print()

void Couenne::exprLowerBound::print ( std::ostream & out = std::cout,
bool = false ) const
inlinevirtual

Print to iostream.

Reimplemented from Couenne::exprVar.

Definition at line 59 of file CouenneExprBound.hpp.

◆ operator()()

CouNumber Couenne::exprLowerBound::operator() ( )
inlinevirtual

return the value of the variable

Reimplemented from Couenne::exprVar.

Definition at line 64 of file CouenneExprBound.hpp.

◆ differentiate()

expression * Couenne::exprLowerBound::differentiate ( int )
inlinevirtual

differentiation

Reimplemented from Couenne::exprVar.

Definition at line 68 of file CouenneExprBound.hpp.

◆ dependsOn()

int Couenne::exprLowerBound::dependsOn ( int * ,
int ,
enum dig_type type = STOP_AT_AUX )
inlinevirtual

dependence on variable set

Reimplemented from Couenne::expression.

Definition at line 72 of file CouenneExprBound.hpp.

◆ Linearity()

virtual int Couenne::exprLowerBound::Linearity ( )
inlinevirtual

get a measure of "how linear" the expression is:

Reimplemented from Couenne::exprVar.

Definition at line 76 of file CouenneExprBound.hpp.

◆ code()

virtual enum expr_type Couenne::exprLowerBound::code ( )
inlinevirtual

code for comparisons

Reimplemented from Couenne::exprVar.

Definition at line 80 of file CouenneExprBound.hpp.


The documentation for this class was generated from the following file: