Mathematics, 14.05.2021 03:40 avashon09
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).
MIN X1 + X2 + X3 + X4
s. t. X1 + X4 ≥ 12 (on duty during shift 1)
X1 + X2 ≥ 15 (on duty during shift 2)
X2 + X3 ≥ 16 (on duty during shift 3)
X3 + X4 ≥ 14 (on duty during shift 4)
X1, X2, X3, and X4 ≥ 0
Given the optimal solution: X1* = 13, X2* = 2, X3* = 14, X4* = 0, how many workers would be assigned to shift 2?
a. 13
b. 12
c. 14
d. 15
e. 2
Answers: 2
Mathematics, 21.06.2019 17:00, afletcher2000
Jasmine wants to eat at 8: 00pm her meal takes 65mins to cook what time does she need to put the meal in the oven
Answers: 2
Mathematics, 21.06.2019 21:40, Fangflora3
The sides of a parallelogram are 24cm and 16cm. the distance between the 24cm sides is 8 cm. find the distance between the 16cm sides
Answers: 3
Mathematics, 21.06.2019 21:50, spookymod8967
What is the 17th term in the arithmetic sequence in which a6 is 101 and a9 is 83
Answers: 3
The following is a linear programming formulation of a labor planning problem. There are four overla...
Physics, 19.11.2020 15:00
World Languages, 19.11.2020 15:00
Mathematics, 19.11.2020 15:00
Mathematics, 19.11.2020 15:00
Spanish, 19.11.2020 15:00
Biology, 19.11.2020 15:00
Mathematics, 19.11.2020 15:00
Computers and Technology, 19.11.2020 15:10
English, 19.11.2020 15:10