set STU; param ngroup integer >= 0; set GRP := 1..ngroup; set MEM {GRP} within STU; check: card (union {g in GRP} MEM[g]) = card (STU); check {g1 in GRP, g2 in g1+1..ngroup}: card (MEM[g1] inter MEM[g2]) = 0; param people_in {g in GRP} := card(MEM[g]); param cars_in {GRP} >= 0; # ---------------------------- set PRJ; param cars_needed {PRJ} integer >= 0; param min_teams {PRJ} integer >= 0; param max_teams {PRJ} integer >= 0; param total_teams > 0; param rank {STU,PRJ} >= 0, <= card {PRJ}; # ---------------------------- var Assign {GRP,PRJ} binary; var Teams {p in PRJ} integer >= min_teams[p], <= max_teams[p]; # ---------------------------- minimize Total_Rank: sum {g in GRP, p in PRJ} sum {s in MEM[g]} rank[s,p] * Assign[g,p]; subject to Assign_Students {g in GRP}: sum {p in PRJ} Assign[g,p] = 1; subject to Assign_Projects_Min {p in PRJ}: sum {g in GRP} people_in[g] * Assign[g,p] <= 4 * Teams[p]; subject to Assign_Projects_Max {p in PRJ}: sum {g in GRP} people_in[g] * Assign[g,p] >= 3 + 4 * (Teams[p] - 1); subject to Enough_Cars {p in PRJ}: sum {g in GRP} cars_in[g] * Assign[g,p] >= cars_needed[p] * Teams[p]; subject to Number_of_Teams: sum {p in PRJ} Teams[p] = total_teams; # ---------------------------- param cutoff >= 1, <= card {PRJ}; subject to Not_Too_Bad {g in GRP, p in PRJ: sum {s in MEM[g]} rank[s,p] > people_in[g] * cutoff}: Assign[g,p] = 0;