Couenne  0.2
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
CouenneExprTrilinear.hpp
Go to the documentation of this file.
1 /* $Id: CouenneExprTrilinear.hpp 490 2011-01-14 16:07:12Z pbelotti $
2  *
3  * Name: CouenneExprTrilinear.hpp
4  * Author: Pietro Belotti
5  * Purpose: definition of product of three terms
6  *
7  * This file is licensed under the Eclipse Public License (EPL)
8  */
9 
10 #ifndef COUENNE_EXPRTRILINEAR_H
11 #define COUENNE_EXPRTRILINEAR_H
12 
13 #include <vector>
14 
15 #include "CouenneExprMul.hpp"
16 
17 namespace Couenne {
18 
20 
21  class exprTrilinear: public exprMul {
22 
23  public:
24 
26  exprTrilinear (expression **, int);
27 
30 
32  expression *clone (Domain *d = NULL) const
33  {return new exprTrilinear (clonearglist (d), nargs_);}
34 
36  CouNumber gradientNorm (const double *x);
37 
39  virtual void getBounds (expression *&, expression *&);
40 
42  virtual void getBounds (CouNumber &lb, CouNumber &ub);
43 
45  void generateCuts (expression *w, //const OsiSolverInterface &si,
46  OsiCuts &cs, const CouenneCutGenerator *cg,
47  t_chg_bounds * = NULL, int = -1,
50 
52  virtual enum expr_type code ()
53  {return COU_EXPRTRILINEAR;}
54 
56  bool impliedBound (int, CouNumber *, CouNumber *, t_chg_bounds *,
58 
61  virtual CouNumber selectBranch (const CouenneObject *obj,
62  const OsiBranchingInformation *info,
63  expression * &var,
64  double * &brpts,
65  double * &brDist, // distance of current LP
66  // point to new convexifications
67  int &way);
68 
70  virtual void closestFeasible (expression *varind,
71  expression *vardep,
72  CouNumber &left,
73  CouNumber &right) const;
74  };
75 }
76 
77 #endif
Cut Generator for linear convexifications.
virtual void getBounds(expression *&, expression *&)
Get lower and upper bound of an expression (if any)
exprTrilinear(expression **, int)
Constructor.
virtual enum expr_type code()
code for comparison
OsiObject for auxiliary variables $w=f(x)$.
status of lower/upper bound of a variable, to be checked/modified in bound tightening ...
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
expression * clone(Domain *d=NULL) const
Cloning method.
virtual void closestFeasible(expression *varind, expression *vardep, CouNumber &left, CouNumber &right) const
compute and for Violation Transfer algorithm
auxSign
&quot;sign&quot; of the constraint defining an auxiliary.
bool impliedBound(int, CouNumber *, CouNumber *, t_chg_bounds *, enum Couenne::expression::auxSign=Couenne::expression::AUX_EQ)
implied bound processing
expression ** clonearglist(Domain *d=NULL) const
clone argument list (for use with clone method)
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&#39;s arguments ...
double CouNumber
main number type in Couenne
int nargs_
number of arguments (cardinality of arglist)
#define COUENNE_INFINITY
expr_type
code returned by the method expression::code()
class for multiplications
Expression base class.
Define a dynamic point+bounds, with a way to save and restore previous points+bounds through a LIFO s...
CouNumber gradientNorm(const double *x)
return l-2 norm of gradient at given point
class for multiplications,