// This is a C++ style comment

// This is a MILP formulation for the table covering problem given in
// the mid-term exam, Q 7. Select a minimum number of primes such that
// all 7 minterms are covered.

// Objective
min: p1 + p2 + p3 + p4 + p5;

// Constraints 
m1: p3 + p4 >= 1;
m2: p4 + p5 >=1;
m3: p3 + p5 >=1;
m4: p2 + p3 >= 1;
m5: p2 + p4 >= 1;
m6: p1 + p2 >= 1;
m7: p1 + p4 >=1;

// This is a ZOLP, 0-1-LP
0<= p1 <= 1;
0<= p2 <= 1;
0<= p3 <= 1;
0<= p4 <= 1;
0<= p5 <= 1;

// This is also important
int p1, p2, p3, p4, p5;

// Try to comment the above integer declaration and see what result
// you get. The p_i's will be treated as reals.