00:01
This problem says the graph to the right shows a region of feasible solutions.
00:04
Use this region to find the maximum and minimum values of the given objective functions and the locations of these values in the graph.
00:10
So when we are given a feasible region, our maximum and minimum values are found from the intersection points that hold that shared region.
00:19
And for the evaluation, we will just go through for both a and b and evaluate for our z output based on all four of our points from the intersection points.
00:28
So we will show z equal to 2 times 0 plus 7 times 4 for our first point.
00:35
And that gives us an evaluation of 0 plus 28, which is 28.
00:40
For our next point, we'll have 2 times 3 plus 7 times 5.
00:46
That gives us 6 plus 35, which is 41.
00:50
For our next ordered pair, 8, 3, that would be 2 times 8 plus 7 times 3.
00:57
That's going to give us 16 plus 21, which gives us 37 for the output.
01:03
And for our last point to test for 1, that's 2 times 4 plus 7 times 1, which gives us 8 plus 7, which is 15.
01:13
So it looks like we have a minimum, and we were asked about the maximum first, so we'll list the max first...