The following is a linear programming formulation of a labor planning problem. T
ID: 2678118 • Letter: T
Question
The following is a linear programming formulation of a labor planning problem. There are four overlapping shifts, and management must decide how many employees to schedule to start work on each shift. The objective is to minimize the total number of employees required while the constraints stipulate how many employees are required at each time of day. The variables X1 - X4 represent the number of employees starting work on each shift (shift 1 through shift 4).Minimize X1 + X2 + X3 + X4
Subject to: X1 + X4 ? 12 (shift 1)
X1 + X2 ? 15 (shift 2)
X2 + X3 ? 16 (shift 3)
X3 + X4 ? 14 (shift 4)
all variables ? 0
Find the optimal solution using QM.
How many workers would be assigned to shift 4?
1
0
14
none of the above
Explanation / Answer
Acc to me u hv solved the whole prb on ur own and got X3 =14 So 14 workers shud b assigned to shift3 b)14
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.