CouenneExprMax.hpp

Go to the documentation of this file.

/* $Id: CouenneExprMax.hpp 1147 2015-05-04 14:01:51Z stefan $
 *
 * Name:    exprMax.hpp
 * Author:  Pietro Belotti
 * Purpose: definition of $\f{\textrm{argmax}_{i\in I} y_i}$ 
 *
 * (C) Carnegie-Mellon University, 2006-09.
 * This file is licensed under the Eclipse Public License (EPL)
 */

#ifndef COUENNE_EXPRMAX_H
#define COUENNE_EXPRMAX_H

#include "CouenneExprOp.hpp"
#include "CouenneExprCopy.hpp"
#include "CouenneExprStore.hpp"

namespace Couenne {


class exprMax: public exprOp {

 public:

  exprMax  (expression **al, int n): 
    exprOp (al, n) {} //< non-leaf expression, with argument list

  exprMax  (expression *el0, expression *el1):
    exprOp (new expression * [4], 4) {
    arglist_ [0] = new exprCopy (el0); arglist_ [1] = new exprStore (arglist_ [0]);
    arglist_ [2] = new exprCopy (el1); arglist_ [3] = new exprStore (arglist_ [2]);
  }

  exprMax *clone (Domain *d = NULL) const
    {return new exprMax (clonearglist (d), nargs_);}

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

  enum pos printPos () const
    {return PRE;}

  inline CouNumber operator () ();

  inline expression *differentiate (int) 
    {return NULL;} 

  inline expression *simplify () 
    {return NULL;}

  virtual inline int Linearity () 
    {return NONLINEAR;}

  // Get lower and upper bound of an expression (if any)
  void getBounds (expression *&, expression *&);

  virtual inline exprAux *standardize (CouenneProblem *, bool addAux = true)
    {return NULL;}

  void generateCuts (expression *w, //const OsiSolverInterface &si, 
                     OsiCuts &cs, const CouenneCutGenerator *cg, 
                     t_chg_bounds * = NULL, int = -1, 
                     CouNumber = -COUENNE_INFINITY, 
                     CouNumber =  COUENNE_INFINITY);

  virtual enum expr_type code ()
  {return COU_EXPRMAX;}
};



inline CouNumber exprMax::operator () () {

  CouNumber best_val = (*(arglist_ [0])) ();
  int best_ind = 0;

  for (int ind = 2; ind < nargs_; ind += 2) {

    CouNumber val = (*(arglist_ [ind])) ();

    if (val > best_val) {
      best_ind = ind;
      best_val = val;
    }
  }

  return (*(arglist_ [best_ind + 1])) ();
}

}

#endif