Week $2$ Assignment: Linear Programming

$2.$ A city police department has the following minimal daily requirement for policeman. Note you are to consider period $1$ as following immediately after period $6.$ Each policeman works eight consecutive hours. Let $x$ denote the number of men starting work in period $t$ everyday. The police department seeks a daily manpower schedule that employs the least number of policemen, provided that each of the above requirements is met. Formulate linear programming model to find an optimal schedule.

$\backslash$table$[[$Time of Day,eriod,$\backslash$table$[[$Minimal number$],[$of police$],[$required during$],[$a period$]]],[2-6,1,20],[6-10,2,50]]$

MacBook Air

$G$

H

J

K

L

:

$"$