CglStored.hpp

Go to the documentation of this file.

// $Id: CglStored.hpp 1119 2013-04-06 20:24:18Z stefan $
// Copyright (C) 2005, International Business Machines
// Corporation and others.  All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).

#ifndef CglStored_H
#define CglStored_H

#include <string>

#include "CglCutGenerator.hpp"

class CoinWarmStartBasis;
class CglTreeProbingInfo;
class CglStored : public CglCutGenerator {
 
public:
    
  
  virtual void generateCuts( const OsiSolverInterface & si, OsiCuts & cs,
                             const CglTreeInfo info = CglTreeInfo());

  inline void setRequiredViolation(double value)
  { requiredViolation_=value;}
  inline double getRequiredViolation() const
  { return requiredViolation_;}
  inline void setProbingInfo(CglTreeProbingInfo * info)
  { probingInfo_ = info;}

  void addCut(const OsiCuts & cs);
  void addCut(const OsiRowCut & cut);
  void addCut(double lb, double ub, const CoinPackedVector & vector);
  void addCut(double lb, double ub, int size, const int * colIndices, const double * elements);
  inline int sizeRowCuts() const
  { return cuts_.sizeRowCuts();}
  const OsiRowCut * rowCutPointer(int index) const
  { return cuts_.rowCutPtr(index);}
  void saveStuff(double bestObjective, const double * bestSolution,
                 const double * lower, const double * upper);
  inline const double * bestSolution() const
  { return bestSolution_;}
  double bestObjective() const;
  const double * tightLower() const
  { return bounds_;} 
  const double * tightUpper() const
  { return bounds_+numberColumns_;} 

  CglStored (int numberColumns=0);
 
  CglStored (const CglStored & rhs);

  CglStored (const char * fileName);

  virtual CglCutGenerator * clone() const;

  CglStored &
    operator=(const CglStored& rhs);
  
  virtual
    ~CglStored ();
      
protected:
  
 // Protected member methods

  // Protected member data

  double requiredViolation_;
  CglTreeProbingInfo * probingInfo_;
  OsiCuts cuts_;
  int numberColumns_;
  double * bestSolution_;
  double * bounds_;
};
#endif