class sum,
More...
#include <CouenneExprSum.hpp>
Public Member Functions | |
exprSum (expression **=NULL, int=0) | |
Constructors, destructor. | |
exprSum (expression *, expression *) | |
Constructor with two elements. | |
virtual | ~exprSum () |
Empty destructor. | |
virtual expression * | clone (Domain *d=NULL) const |
Cloning method. | |
std::string | printOp () const |
Print operator. | |
virtual CouNumber | operator() () |
Function for the evaluation of the expression. | |
virtual expression * | differentiate (int index) |
Differentiation. | |
virtual expression * | simplify () |
Simplification. | |
virtual int | Linearity () |
Get a measure of "how linear" the expression is:. | |
virtual void | getBounds (expression *&, expression *&) |
Get lower and upper bound of an expression (if any). | |
virtual void | getBounds (CouNumber &, CouNumber &) |
Get lower and upper bound of an expression (if any). | |
virtual exprAux * | standardize (CouenneProblem *p, bool addAux=true) |
Reduce expression in standard form, creating additional aux variables (and constraints). | |
virtual void | generateCuts (expression *, OsiCuts &, const CouenneCutGenerator *, t_chg_bounds *=NULL, int=-1, CouNumber=-COUENNE_INFINITY, CouNumber=COUENNE_INFINITY) |
Special version for linear constraints. | |
virtual enum expr_type | code () |
Code for comparison. | |
virtual bool | impliedBound (int, CouNumber *, CouNumber *, t_chg_bounds *, enum auxSign=expression::AUX_EQ) |
Implied bound. | |
exprAux * | createQuadratic (CouenneProblem *) |
Checks for quadratic terms in the expression and returns an exprQuad if there are enough to create something that can be convexified. | |
Protected Member Functions | |
int | impliedBoundSum (CouNumber wl, CouNumber wu, std::vector< CouNumber > &xl, std::vector< CouNumber > &xu, std::vector< std::pair< int, CouNumber > > &nl, std::vector< std::pair< int, CouNumber > > &nu) |
inferring bounds on factors of a product |
class sum,
Definition at line 22 of file CouenneExprSum.hpp.
Couenne::exprSum::exprSum | ( | expression ** | = NULL , |
|
int | = 0 | |||
) |
Constructors, destructor.
Referenced by clone().
Couenne::exprSum::exprSum | ( | expression * | , | |
expression * | ||||
) |
Constructor with two elements.
virtual Couenne::exprSum::~exprSum | ( | ) | [inline, virtual] |
Empty destructor.
Definition at line 33 of file CouenneExprSum.hpp.
virtual expression* Couenne::exprSum::clone | ( | Domain * | d = NULL |
) | const [inline, virtual] |
Cloning method.
Reimplemented from Couenne::expression.
Reimplemented in Couenne::exprGroup, and Couenne::exprQuad.
Definition at line 36 of file CouenneExprSum.hpp.
References Couenne::exprOp::clonearglist(), exprSum(), and Couenne::exprOp::nargs_.
std::string Couenne::exprSum::printOp | ( | ) | const [inline, virtual] |
Print operator.
Reimplemented from Couenne::exprOp.
Definition at line 40 of file CouenneExprSum.hpp.
CouNumber Couenne::exprSum::operator() | ( | ) | [inline, virtual] |
Function for the evaluation of the expression.
compute sum
Implements Couenne::expression.
Reimplemented in Couenne::exprGroup, and Couenne::exprQuad.
Definition at line 118 of file CouenneExprSum.hpp.
References Couenne::exprOp::arglist_, and Couenne::exprOp::nargs_.
virtual expression* Couenne::exprSum::differentiate | ( | int | index | ) | [virtual] |
Differentiation.
Reimplemented from Couenne::expression.
Reimplemented in Couenne::exprGroup, and Couenne::exprQuad.
virtual expression* Couenne::exprSum::simplify | ( | ) | [virtual] |
Simplification.
Reimplemented from Couenne::exprOp.
Reimplemented in Couenne::exprGroup, and Couenne::exprQuad.
virtual int Couenne::exprSum::Linearity | ( | ) | [virtual] |
Get a measure of "how linear" the expression is:.
Reimplemented from Couenne::exprOp.
Reimplemented in Couenne::exprGroup, and Couenne::exprQuad.
virtual void Couenne::exprSum::getBounds | ( | expression *& | , | |
expression *& | ||||
) | [virtual] |
Get lower and upper bound of an expression (if any).
Reimplemented in Couenne::exprGroup, and Couenne::exprQuad.
Get lower and upper bound of an expression (if any).
Reimplemented from Couenne::expression.
Reimplemented in Couenne::exprGroup, and Couenne::exprQuad.
virtual exprAux* Couenne::exprSum::standardize | ( | CouenneProblem * | p, | |
bool | addAux = true | |||
) | [virtual] |
Reduce expression in standard form, creating additional aux variables (and constraints).
Reimplemented from Couenne::exprOp.
virtual void Couenne::exprSum::generateCuts | ( | expression * | , | |
OsiCuts & | , | |||
const CouenneCutGenerator * | , | |||
t_chg_bounds * | = NULL , |
|||
int | = -1 , |
|||
CouNumber | = -COUENNE_INFINITY , |
|||
CouNumber | = COUENNE_INFINITY | |||
) | [virtual] |
Special version for linear constraints.
Reimplemented in Couenne::exprGroup, and Couenne::exprQuad.
virtual enum expr_type Couenne::exprSum::code | ( | ) | [inline, virtual] |
Code for comparison.
Reimplemented from Couenne::exprOp.
Reimplemented in Couenne::exprGroup, and Couenne::exprQuad.
Definition at line 73 of file CouenneExprSum.hpp.
References Couenne::COU_EXPRSUM.
virtual bool Couenne::exprSum::impliedBound | ( | int | , | |
CouNumber * | , | |||
CouNumber * | , | |||
t_chg_bounds * | , | |||
enum | auxSign = expression::AUX_EQ | |||
) | [virtual] |
Implied bound.
An expression
is given such that all are positive for
and negative for
. If the bounds on
, implied bounds on all
are as follows:
,
where and
are lower and upper bound, respectively, of
. We also have to check if some of these bounds are infinite.
Reimplemented from Couenne::expression.
Reimplemented in Couenne::exprQuad.
exprAux* Couenne::exprSum::createQuadratic | ( | CouenneProblem * | ) |
Checks for quadratic terms in the expression and returns an exprQuad if there are enough to create something that can be convexified.
int Couenne::exprSum::impliedBoundSum | ( | CouNumber | wl, | |
CouNumber | wu, | |||
std::vector< CouNumber > & | xl, | |||
std::vector< CouNumber > & | xu, | |||
std::vector< std::pair< int, CouNumber > > & | nl, | |||
std::vector< std::pair< int, CouNumber > > & | nu | |||
) | [protected] |
inferring bounds on factors of a product