Question $31to$ Question $34is$ based $on$ this problem:

Disneyland $in$ California has six $8-$hour shifts for its daily maintenance. The schedule $of$ the shifts $is$ given $in$ the table:

The following table summarizes the minimum number $of$ workers needed for six $4-$hour time periods $in$ a day:

Assume each worker only works for one shift each day. The maintenance supervisor wants $to$ determine the minimum number $of$ workers needed for each day $to$ meet the minimum staffing requirements.

Formulate the Integer Linear Programming $(ILP)$ for this problem. Hint: create a spreadsheet table with one dimension $on$ six $8-$hour shifts and the other dimension $on$ six $4-$hour time periods. The structure $of$ the table $is$ similar $to$ that $of$ the table shown $in$ the spreadsheet $on$ slide #$24of$ Chapter $6.$

Let $Xi=$ the number $of$ workers $in$ shift $i,$ with $i=1,2,3,4,5,6.$

Which $of$ the following expressions $is$ the objective function $of$ the Integer Linear Programming problem?

Group $of$ answer choices

Min $[X1+X2+1\mathrm{.}5X3+1\mathrm{.}5X4+2X5+2X6]$

Max $[X1+X2+1\mathrm{.}5X3+1\mathrm{.}5X4+2X5+2X6]$

Min $[X1+X2+X3+X4+X5+X6]$

Max $[X1+X2+X3+X4+X5+X6]$

Flag question: Question $32$

Question $323pts$

Which shifts will cover the time period $of12$:$00am-4$:$00am?$

Group $of$ answer choices

Shift $1$ and $2$

Shift $1$ and $6$

Shift $4$ and $5$

Shift $1,5,$ and $6$

Shift $2,5$ and $6$

Flag question: Question $33$

Question $333pts$

Which constraint ensures there are enough people $in$ the time period $of12$:$00pm-4$:$00pm?$

Group $of$ answer choices

$X2+X4155$

$X3+X5155$

$X3+X4155$

$X3+X4155$

Question $31to$ Question $34is$ based $on$ this problem:

Disneyland $in$ California has six $8-$hour shifts for its daily maintenance. The schedule $of$ the shifts $is$

given $in$ the table:

The following table summarizes the minimum number $of$ workers needed for six $4-$hour time periods

$in$ a day:

Assume each worker only works for one shift each day. The maintenance supervisor wants $to$

determine the minimum number $of$ workers needed for each day $to$ meet the minimum staffing

requirements.

Formulate the Integer Linear Programming $(ILP)$ for this problem. Hint: create a spreadsheet table

with one dimension $on$ six $8-$hour shifts and the other dimension $on$ six $4-$hour time periods. The

structure $of$ the table $is$ similar $to$ that $of$ the table shown $in$ the spreadsheet $on$ slide #$24of$ Chapter

Let $=$ the number $of$ workers $in$ shift $i,$ with $i=1,2,3,4,5,6.$

Which $of$ the following expressions $is$ the objective function $of$ the Integer Linear Programming

problem?

Min$[x_1+x_2+1\mathrm{.}53+1\mathrm{.}54+25+2x_6]$

Max$[1+x2+1\mathrm{.}53+1\mathrm{.}54+25+26]$

Min$[x_1+x_2+x_3+x_4+x_5+x_6]$

Max$[x_1+x_2+x_3+x_4+x_5+x_6]$ Question $32$

Which shifts will cover the time period $of12$:$00am-4$:$00am?$

Shift $1$ and $2$

Shift $1$ and $6$

Shift $4$ and $5$

Shift $1,5,$ and $6$

Shift $2,5$ and $6$

Question $33$

Which constraint ensures there are enough people $in$ the time period $of12$:$00pm-4$:$00pm?$

$x2+x4155$

$x3+x5155$

$x3+x4155$

$x_3+x_{4}155$

Question $34$

Suppose the maintenance supervisor also requires the number $of$ workers who work $in$ the time

period $of8$:$00am-4$:$00pm$ must $beno$ less than $50\%of$ the number $of$ workers needed for the

whole day. Which $of$ the following constraints satisfies this requirement?

None $of$ the above constraints

$x_3+x_4+x_5{x}_1+x_2+x_6$

$x_2+x_3{x}_1+x_4+x_5+x_6$

$x_3+x_4{x}_1+x_2+x_5$

$x_2+x_3+x_4{x}_1+x_5+x_6$