00:01
For chapter 5, section 6, question 35, we know that x is going to be greater than or equal to 0.
00:08
We also know that y is going to be greater than or equal to zero.
00:13
And we know that x plus 1 .2y cannot exceed 1 ,200 labor hours for assembly and for packaging.
00:26
They can't exceed 540.
00:38
And we also have our objective function, which is that z equals 90x plus 120 y for our profit.
00:50
So we're trying to maximize profit here.
00:57
Okay.
01:02
So eventually, when we look at the graph, it's going to look something like this, and i'm going to find our intercepts for each of these.
01:24
So x can be 1 ,200.
01:27
That's a pretty significant number.
01:29
I'm going to put 1 ,200 here.
01:31
This is just a rough sketch.
01:33
This isn't something you have to do.
01:39
And y has to be 1 ,000 at most.
01:47
And i'm just going to connect those.
01:51
We also have, for other intercepts, x can be at most 1350.
02:01
Okay.
02:04
So i'm going to put this.
02:05
This will be 1350.
02:09
And y can be at most.
02:16
900.
02:19
So i'll just put that here just so we can see it better.
02:24
I'm going to bring out my roller for this one.
02:34
Awesome.
02:41
And all of these numbers have to be less than the given ones except zero.
02:47
So we have an intersection here, here, and here, and our feasible region...