cons_obj.cc

#include<scil/cons_obj.h>
#include<scil/var_obj.h>
#include<scil/row.h>
#include<scil/subproblem.h>

cons_obj::cons_obj (cons_sense s, double rhs__)
{
  sense_ = s;
  rhs_ = rhs__;

  //init();
};

cons_obj::cons_obj ()
{
  sense_ = Equal;
  rhs_ = 0;

  //init();
}

bool
cons_obj::violated (subproblem & S)
{
  row
    r;
  row_entry
    t;
  double
    x = 0;
  non_zero_entries(r);
  forall (t, r)
  {
    x += t.coeff * S.value (t.Var);
  };

  if (sense () == Equal)
    return fabs (x - rhs ()) > 0.001;
  if (sense () == Less)
    return x - rhs () > 0.001;
  return x - rhs () < -0.001;
}

void
cons_obj::init ()
{
  row r;
  non_zero_entries(r);

  non_zeros=r.size();
  rows=new int[non_zeros];
  coeffs=new double[non_zeros];

  row_entry v;
  int i=0;
  forall(v, r) {
    rows[i]=v.Var.index();
    coeffs[i]=v.coeff;
    i++;
  };
}

void
cons_obj::set_sense (cons_sense s)
{
  /*{\Mop sets the sense of the basic constraint.} */
  sense_ = s;
};


void
cons_obj::set_rhs (double r)
{
  /*{\Mop sets the right-hand side of the basic constraint.} */
  rhs_ = r;
};

double
cons_obj::rhs ()
{
  /*{\Mop returns the right-hand-side.} */
  return rhs_;
};


cons_sense
cons_obj::sense ()
{
  /*{\Mop retunrs the sense.} */
  return sense_;
}

void
cons_obj::set (var_obj * v, double d)
{
  CM[v] = d;
}

double
cons_obj::upper_bound() {
  if(sense()==Greater) return 1e+30;
  return rhs();
}

double
cons_obj::lower_bound() {
  if(sense()==Less) return -1e+30;
  return rhs();
};

---