max.cc

#include<scil/scil.h>
#include<scil/constraints/max.h>

#include<iostream>
#include<fstream>
#include<string>
#include<cstdlib>

#define INPATH ""

using std::cout;
using std::cerr;
using std::endl;
using std::ifstream;

using namespace SCIL;

int main(int argc, char** argv)
{

   //initialize the ILP
   ILP_Problem IP(Optsense_Min);
   var_map<int> VM1;
   var_map<int> VM2;
   std::map<var, double> CF1;
   std::map<var, double> CF2;
   double G1[3] = {2., -3., 3.};
   double G2[4] = {-1., 3., 1., -5.};

   var v = IP.add_variable(1., 0, 17, Vartype_Integer);
   var w = IP.add_variable(1., 0, 17, Vartype_Integer);

   for( int i = 0; i < 3; i++) {
      VM1[i]=IP.add_variable(G1[i], 0, 10, Vartype_Integer);
      CF1[VM1[i]] = 1.;
   }
   for( int i = 0; i < 4; i++) {
      VM2[i]=IP.add_variable(G2[i], 0, 10, Vartype_Integer);
      CF2[VM2[i]] = 1.;
   }
   VM2[4] = VM1[1];
   CF2[VM2[4]] = 1.;

   row r;
   r += VM1[0];
   r += VM1[1];
   IP.add_basic_constraint(r>=14.);

   //add the symbolic constraints
   IP.add_sym_constraint(new MAX(v, VM1, CF1, 3));
   IP.add_sym_constraint(new MAX(w, VM2, CF2, 5));

   //solve the problem
   IP.optimize();

   //output the solution
   solution sol =  IP.get_solution();
   double sum = 0.;

   for( int i = 0; i < 3; i++)
      cout << "x" << i << ": " << sol.value(VM1[i]) << endl;
   for( int i = 0; i < 4; i++)
      cout << "x" << i << ": " << sol.value(VM2[i]) << endl;
   cout << "v: " << sol.value(v) << endl;
   cout << "w: " << sol.value(w) << endl;

   return 0;
}

---