BonEcpCuts.hpp

Go to the documentation of this file.

// (C) Copyright International Business Machines (IBM) 2006, 2007
// All Rights Reserved.
// This code is published under the Eclipse Public License.
//
// Authors :
// P. Bonami, International Business Machines
//
// Date :  12/20/2006
 
#ifndef BonECPCuts_HPP
#define BonECPCuts_HPP
 
#include "BonOaDecBase.hpp"
#include "CglCutGenerator.hpp"
namespace Bonmin
{
  class EcpCuts: public OaDecompositionBase
  {
  public:
    EcpCuts(BabSetupBase & b);

    EcpCuts(const EcpCuts & copy):
        OaDecompositionBase(copy),
        objValue_(copy.objValue_),
        numRounds_(copy.numRounds_),
        abs_violation_tol_(copy.abs_violation_tol_),
        rel_violation_tol_(copy.rel_violation_tol_),
        beta_(copy.beta_)
    {}

    CglCutGenerator * clone() const
    {
      return new EcpCuts(*this);
    }

    virtual ~EcpCuts()
    {}

    virtual void generateCuts(const OsiSolverInterface &si,  OsiCuts & cs,
        const CglTreeInfo info = CglTreeInfo());
    double doEcpRounds(OsiSolverInterface &si,
        bool leaveSiUnchanged,
        double* violation = NULL);
 
    void setNumRounds(int value)
    {
      numRounds_ = value;
    }
 
    void setPropabilityFactor(double value)
    {
      beta_ = value;
    }
 
    void setAbsViolationTolerance(double value)
    {
      abs_violation_tol_ = value;
    }
    void setRelViolationTolerance(double value)
    {
      rel_violation_tol_ = value;
    }

    static void registerOptions(Ipopt::SmartPtr<Bonmin::RegisteredOptions> roptions);
 
  protected:
    virtual double performOa(OsiCuts & cs, solverManip &lpManip,
                   BabInfo * babInfo, double &cutoff, const CglTreeInfo &info) const
    {
      throw -1;
    }

    virtual bool doLocalSearch(BabInfo * babInfo) const
    {
      return 0;
    }
  private:
    mutable double objValue_;
    mutable double violation_;
    int numRounds_;
    double abs_violation_tol_;
    double rel_violation_tol_;
    double beta_;
  };
} /* end namespace Bonmin.*/
#endif