poltest2.cc

#include<fstream>
#include<scil/scil.h>
#include<scil/constraints/cut.h>
#include<scil/core/polynomial.h>

#define LEPS 1e-4
using namespace SCIL;

int main(int argc, char** argv) {
   
   //Initialize the ILP
   ILP_Problem IP(Optsense_Max);

   //Add some variables to the ILP
   var a = IP.add_binary_variable(0.);
   var b = IP.add_binary_variable(0.);
   var c = IP.add_binary_variable(0.);

   //Create some polynomials
   polynomial p1 = a*b + a + 3*a*b*c;
   polynomial p2 = p1 - 3*a*b;
   polynomial p3 = a*b*c;
   p3 -= b*c*a;

   //normalize the polynomials
   polynomial p1n(p1);
   polynomial p2n(p2);
   polynomial p3n(p3);
   polynomial p3nc(p3);
   p1n.normalize();
   p2n.normalize();
   p3n.normalize();
   p3nc.normalize(true);

   //add polynomials to the objective function
   IP.add_polynomial(p1);
   IP.add_polynomial(2*b);

   //add polynomial constraint
   polynomial p_cons = c*b + 2*c;
   IP.add_pol_constraint(p_cons <= 1.);

   //solve the ILP
   IP.optimize();

   //output the polynomials
   cerr << "p1: " << p1 << "   normalized: " << p1n << endl;
   cerr << "p2: " << p2 << "   normalized: " << p2n << endl;
   cerr << "p3: " << p3 << "   normalized: " << p3n << "   normalized with clean=true: " << p3nc << endl;
   
   //output objective function coefficient
   cerr << "objective function coefficients:" << endl;
   cerr << "a: " << IP.get_obj_coefficient(a) << " b: " << IP.get_obj_coefficient(b) << " c: " << IP.get_obj_coefficient(c) << endl; 

   //output solution
   solution sol = IP.get_solution();
   cerr << "solution:" << endl;
   cerr << "a: " << sol.value(a) << " b: " << sol.value(b) << " c: " << sol.value(c) << endl;

   return 0;
}

---