00:01
For this question, we are going to optimize and find a maximum or minimum income or both from the given information.
00:16
Number of biscuits.
00:18
We've got jumbo and regular.
00:23
I am going to let x be the jumbo and y be the regular.
00:37
I know that we have to be in quadrant one.
00:40
We can't make a negative number of biscuits.
00:42
So quadrant 1.
00:46
At most, 300 biscuits.
01:02
Let me back that up a little bit.
01:04
I need to scale it a little bit more.
01:05
So 300, 300.
01:10
And we would have a line shaded below that line.
01:13
So we have a triangular region so far.
01:16
We also know that we have a limit to the amount of flour.
01:21
Each jumbo biscuit, x, takes two cups, and each regular takes y.
01:28
And there's a limit.
01:31
So for that, my x intercept is 250 and my y intercept is 500.
01:44
This is our feasible region.
01:47
We want to look at the ordered pairs...