Scribd
Upload
44 views5 pages

Module 7 Enabling Assessment Linear Programming

The document discusses scheduling police officers for 8-hour shifts starting at 6 times of day to meet minimum staffing requirements. It aims to determine the number of officers to schedule at each time slot to minimize total staff needed. It also contains an example transportation problem and asks to find an alternative optimal solution.

Uploaded by

Janielle Nave
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
44 views5 pages

Module 7 Enabling Assessment Linear Programming

The document discusses scheduling police officers for 8-hour shifts starting at 6 times of day to meet minimum staffing requirements. It aims to determine the number of officers to schedule at each time slot to minimize total staff needed. It also contains an example transportation problem and asks to find an alternative optimal solution.

Uploaded by

Janielle Nave
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

B-BANA402LC Linear Programming Model - Enabling Assesment 1

Problem 1

The Clark County Sheriff’s Department schedules police officers for 8-hour shifts. The beginning times for the shifts are 8:00 a.m., noon,
4:00 p.m., 8:00 p.m., midnight, and 4:00 a.m. An officer beginning a shift at one of these times works for the next 8 hours. During normal
weekday operations, the number of officers needed varies depending on the time of day. The department staffing guidelines require the
following minimum number of officers on duty:

Determine the number of police officers that should be scheduled to begin the 8-hour shifts at each of the six times (8:00 a.m., noon, 4:00
p.m., 8:00 p.m., midnight, and 4:00 a.m.) to minimize the total number of officers required. (Hint: Let x1 = the number of officers beginning
work at 8:00 a.m., x2 = the number of officers beginning work at noon, and so on.)
B-BANA402LC Linear Programming Model - Enabling Assesment 2

Problem 2
B-BANA402LC Linear Programming Model - Enabling Assesment 3

Problem 3
B-BANA402LC Linear Programming Model - Enabling Assesment 4

Problem 4
B-BANA402LC Linear Programming Model - Enabling Assesment 5

Problem 5

Refer to the transportation problem above. Try to find an alternative optimal solution.

You might also like