00:02
So for this problem, to formulate and solve this linear programming issue, we can use the information provided to set up the objective function and constraints.
00:12
Let's go through each part.
00:15
For starters, we have the linear programming model with an objective function to maximize z equals 5r plus 8c.
00:32
This is subject to constraints, and there's four of them.
00:41
For cutting and suing, r plus 3 halves less than or equal to 900.
00:47
For finishing, it's 1 half r plus c over 3 less than or equal to 300.
01:05
For packaging and shipping, it's 1 eighth r plus 1 fourth c less than or equal to 100.
01:16
And then for non -negativity constraints, you'd have to have r greater than zero equal to it and c the same.
01:25
But for b, the spreadsheet model and solver solution, we have a regular model of 150 units, and you can use spreadsheet software like excel to set up and solve this linear programming problem.
01:40
We also have a catcher's model c of 300 units.
01:47
C would be the total profit contribution, where total profit would be 5 times 150.
01:53
So you basically just substitute the values of r and c into the objective function plus 8 times 300 equals 3 ,450.
02:08
D, hours of production time scheduled.
02:12
So to calculate the hours of production time scheduled in each department, you use the production requirement for each model.
02:18
So for the regular model, for cutting and suing, we would do 1 hour per unit.
02:29
For finishing, 1 half hour per unit.
02:35
That's cutting and suing...