LinBil.h

Go to the documentation of this file.

//
//     Minotaur -- It's only 1/2 bull
//
//     (C)opyright 2008 - 2025 The Minotaur Team.
//
 
#ifndef MINOTAURLINBIL_H
#define MINOTAURLINBIL_H
 
#include "Handler.h"
 
namespace Minotaur {
 
class LinBil {
 private:
  double aTol_;
 
  ConstraintPtr c0_;
 
  ConstraintPtr c1_;
 
  ConstraintPtr c2_;
 
  ConstraintPtr c3_;
 
  // Quadratic constraint in the transformed problem.
  ConstraintPtr qcon_;
 
  double rTol_;
 
  VariablePtr x0_;
 
  VariablePtr x1_;
 
  VariablePtr y_;
 
 public:
  LinBil(VariablePtr y, VariablePtr x0, VariablePtr x1, ConstraintPtr con);
 
  ~LinBil();
 
  ConstraintPtr getC0() { return c0_; };
 
  ConstraintPtr getC1() { return c1_; };
 
  ConstraintPtr getC2() { return c2_; };
 
  ConstraintPtr getC3() { return c3_; };
 
  ConstraintPtr getQCon() { return qcon_; };
 
  VariablePtr getY() { return y_; };
 
  VariablePtr getX0() { return x0_; };
 
  VariablePtr getX1() { return x1_; };
 
  VariablePtr getOtherX(ConstVariablePtr x) const;
 
  bool isViolated(const double* x, double& vio) const;
 
  bool isViolated(const double x0val, const double x1val,
                  const double y0val) const;
 
  void setCons(ConstraintPtr c0, ConstraintPtr c1, ConstraintPtr c2,
               ConstraintPtr c3);
};
 
struct CompareLinBil {
  bool operator()(LinBil* b0, LinBil* b1) const;
};
 
typedef std::set<LinBil*, CompareLinBil> LinBilSet;
 
typedef LinBilSet::iterator LinBilSetIter;
}  // namespace Minotaur
 
#endif