00:01
So in this linear programming problem, we know our objective function here, as well as our constraints here.
00:08
And to begin solving this, we want to graph our constraints.
00:12
Looking here, we can see that x and y are both greater than or equal to zero, meaning that our graph will lie solely in the first quadrant.
00:21
Given this equation, you want to graph this line, and i can start by rearranging this equation so that y is greater than or equal to negative 2x plus 4.
00:30
This makes it easier for me to graph since now i know my y intercept is at 4 and my slope is negative 2, meaning that my x intercept would be at 2.
00:44
Here we can do the same thing by rearranging this to be y is less than or equal to negative x plus 9.
00:52
So i know my y intercept would be at 9, and since my slope is negative 1, my x intercept would also be 9.
01:02
And looking at our inequalities, we can shade in this area as the collection of feasible points.
01:12
So what our next step is, is to write down the coordinates of all the corner points...