CouenneExprBSin.hpp

Go to the documentation of this file.

/* $Id: CouenneExprBSin.hpp 748 2011-07-28 16:13:32Z pbelotti $ */
/*
 * Name:    exprBSin.hpp
 * Author:  Pietro Belotti
 * Purpose: definition of operators to compute lower/upper bounds of sines
 *
 * (C) Carnegie-Mellon University, 2006. 
 * This file is licensed under the Eclipse Public License (EPL)
 */

#ifndef COUENNE_EXPRBSIN_HPP
#define COUENNE_EXPRBSIN_HPP

#include "CouenneExprOp.hpp"
#include "CoinHelperFunctions.hpp"

#include <math.h>
#ifndef M_PI
# define M_PI 3.14159265358979323846
#endif

namespace Couenne {


class exprLBSin: public exprOp {

 public:

  exprLBSin (expression *lb, expression *ub): 
    exprOp (new expression * [2], 2) {
    arglist_ [0] = lb;
    arglist_ [1] = ub;
  } //< non-leaf expression, with argument list

  expression *clone (Domain *d = NULL) const
  {return new exprLBSin (arglist_ [0] -> clone (d), 
                         arglist_ [1] -> clone (d));}

  CouNumber operator () ();

  enum pos printPos () const
    {return PRE;}

  std::string printOp () const
    {return "LB_Sin";}
};



inline CouNumber exprLBSin::operator () () {

  register CouNumber 
    l = (*(arglist_ [0])) (),
    u = (*(arglist_ [1])) ();

  CouNumber pi2 = 2 * M_PI;
 
  if ((u - l >= pi2) ||        // 1) interval spans whole cycle
      (floor (l/pi2 - 0.75) < // 2) there is a 3/2 pi + 2k pi between l and u
       floor (u/pi2 - 0.75))) 
    return -1.;

  return CoinMin (sin (l), sin (u));
}




class exprUBSin: public exprOp {

 public:

  exprUBSin (expression *lb, expression *ub): 
    exprOp (new expression * [2], 2) {
    arglist_ [0] = lb;
    arglist_ [1] = ub;
  } //< non-leaf expression, with argument list

  expression *clone (Domain *d = NULL) const
  {return new exprUBSin (arglist_ [0] -> clone (d), 
                         arglist_ [1] -> clone (d));}

  CouNumber operator () ();

  std::string printOp () const
    {return "UB_Sin";}

  enum pos printPos () const
    {return PRE;}
};



inline CouNumber exprUBSin::operator () () {

  register CouNumber 
    l = (*(arglist_ [0])) (),
    u = (*(arglist_ [1])) ();

  CouNumber pi2 = 2 * M_PI;

  if ((u - l >= pi2) ||       // 1) interval spans whole cycle
      (floor (l/pi2 - 0.25) < // 2) there is a pi/2 + 2k pi between l and u
       floor (u/pi2 - 0.25))) 
    return 1.;

  return CoinMax (sin (l), sin (u));
}

}

#endif