Answer Happy

The university is scheduling cleaning crews for its ten
buildings. Each crew has a different cost and is qualified to clean
only certain buildings. There are eight possible crews to choose
from in this case. The goal is to minimize costs while making sure
that each building is cleaned. The management science department
formulated the following linear programming model to help with the
selection process.

Min 200x1 + 250x2 +
225x3 +
190x4 +215x5 +
245x6 + 235x7 +
220x8
s.t. x1 + x2 + x5 + x7 ≥
1 {Building A constraint}
x1 + x2 + x3 ≥
1 {Building B constraint}
x6 + x8 ≥
1 {Building C constraint}
x1 + x4 + x7 ≥
1 {Building D constraint}
x2 + x7 ≥
1 {Building E constraint}
x3 + x8 ≥
1 {Building F constraint}
x2 + x5 + x7 ≥
1 {Building G constraint}
x1 + x4 + x6 ≥
1 {Building H constraint}
x1 + x6 + x8 ≥
1 {Building I constraint}
x1 + x2 + x7 ≥
1 {Building J constraint}
xj={1, if crew j is selected 0, otherwisexj=1, if crew j is selected 0, otherwise
Without solving the BIP model, which crew could be scheduled to
clean Buildings B and F?
rev: 11_03_2020_QC_CS-239455
Multiple Choice
Crew 3
Crew 4
Crew 6
Crew 7
Crew 8