61. Award: 10.00 points

 

MC Qu. 7-61 The university is scheduling cleaning crews...

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 +215x 5 + 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}

m
1,  if  crew j is selected 

e r as
xj =
{ 0,  otherwise

co
eH w
Which of the crews is the least expensive?

o.
 Crew 1 rs e
ou urc
 Crew 2

 Crew 3
o

 Crew 4
aC s

 Crew 5
v i y re

Because the objective is to minimize the cost of crews, the objective function coefficient must represent the cost of each
location. Therefore, crew 4 (coefficient = 190) is the least expensive of the choices.
ed d

References
ar stu

Multiple Choice Difficulty: 2 Medium

sh is

MC Qu. 7-61 The Learning Objective:

university is Formulate a binary integer
scheduling cleaning programming model for
Th

crews... crew scheduling in the

travel industry.

This study source was downloaded by 100000829029605 from CourseHero.com on 07-22-2021 11:40:34 GMT -05:00

https://www.coursehero.com/file/39547583/Data-Analysis-Notes-1pdf/
  
 62. Award: 10.00 points
 

MC Qu. 7-62 The university is scheduling cleaning crews...

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}

m
1,  if  crew j is selected 

e r as
xj =
{ 0,  otherwise

co
eH w
Which of the crews can be scheduled to clean buildings B and F?

o.
 Crew 3 rs e
ou urc
 Crew 4

 Crew 6
o

 Crew 7
aC s

 Crew 8
v i y re

The variable for crew 3 (x3) appears in the set covering constraints for buildings B and F.
ed d

References
ar stu

Multiple Choice Difficulty: 2 Medium

MC Qu. 7-62 The Learning Objective:

sh is

university is Formulate a binary integer

scheduling cleaning programming model for
crews... crew scheduling in the
Th

travel industry.

This study source was downloaded by 100000829029605 from CourseHero.com on 07-22-2021 11:40:34 GMT -05:00

https://www.coursehero.com/file/39547583/Data-Analysis-Notes-1pdf/
  
 63. Award: 10.00 points  

MC Qu. 7-63 The university is scheduling cleaning crews...

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.

Min200x1 + 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}

m
1,  if  crew j is selected 

e r as
xj =
{ 0,  otherwise

co
eH w
Which of the crews can be scheduled to clean building A?

o.
 Crew 1 rs e
ou urc
 Crew 2

 Crew 5
o

 Crew 6
aC s

 Crew 7
v i y re

The variable for location 6 (x6) does not appear in the set covering constraint for building A.
ed d

References
ar stu

Multiple Choice Difficulty: 2 Medium

MC Qu. 7-63 The Learning Objective:

sh is

university is Formulate a binary integer

scheduling cleaning programming model for
crews... crew scheduling in the
Th

travel industry.

This study source was downloaded by 100000829029605 from CourseHero.com on 07-22-2021 11:40:34 GMT -05:00

https://www.coursehero.com/file/39547583/Data-Analysis-Notes-1pdf/
Powered by TCPDF (www.tcpdf.org)