nf.c

#include<scil/scil.h>

using namespace SCIL;

int main() {

  int s=6;

  ILP_Problem IP(Optsense_Min);

  var x[20];

  for(int i=0; i<13; i++) {
    x[i]=IP.add_variable(0,0,10,Vartype_Integer);
  };

  for(int i=13; i<19; i++) {
    x[i]=IP.add_variable(0,0,1000000, Vartype_Integer);
  };

  x[19]=IP.add_variable(-1,0, 1000000, Vartype_Integer);

  IP.add_basic_constraint((s+1)*x[0]-x[1] >= s-1);

  double d;
  for(int i=1; i<19; i++) {
    if(i % 2 == 0) d=-1; else d=1;
    IP.add_basic_constraint(-s*x[i-1]+(s+1)*x[i]-x[i+1] >= d*(s+1));
  };

  IP.add_basic_constraint(-s*x[17]-(3*s-1)*x[18]+3*x[19]>=-(5*s-7));

  //IP.add_basic_constraint((row) x[18]<=0);

  IP.optimize();

  for(int i=0; i<20; i++) {
    cout<<IP.get_solution(x[i])<<" ";
  };
  cout<<"Solution\n";

  return 0;
};

---