00:02
Okay, i produced this graph of our inequality constraints, and they're all greater than or equal to.
00:16
So the feasible region that we're looking at, and x and y had to be greater than or equal to zero as well.
00:27
So let me add that line on there here.
00:38
So the region we're looking at is all of this out here.
00:53
The darkest shaded portion shows where all of these conditions overlap.
01:04
So those corner points that i have labeled, those are gonna help us find the minimum of our objective function.
01:16
Let me write that down.
01:17
It was z equals 20x plus 50y.
01:30
As far as a maximum, well, there isn't gonna be a maximum because this feasible region isn't bounded out this way.
01:49
So i could just pick an arbitrarily large point here.
01:54
I could move it even further out.
01:56
I can allow x and y to be as big as i want them to be.
02:00
There's no limit in that direction.
02:03
So there is no maximum for z.
02:07
The maximum is unlimited...