Here's the question you clicked on:
sapphers
|4x + 3y ≥ 30 |x + 3y ≥ 21 |x ≥ 0, y ≥ 0 -- Minimun for C = 5x + 8y 1. List all vertices of the feasible region as ordered pairs. 2. List the values of the objective function for each vertex. 3. List the maximum or minimum amount, including the x, and y-value, of the objective function. I really really need help! I don't understand what to do.
Are you having issues graphing these equations?
Yes. Just all of it. I did the first step which was to rewrite the constraints in slope-intercept form. I just don't really know what to do from there.
ok so I would graph out your constraints to see how many vertices you have.
so if this is a graph of x and y these are the constrants that x >= 0 and y>=0
Okay yeah, that makes sense because you can't go less than 0 (negative numbers).. right?
I found the maximum. I got 62.76. Is that right?
your other two constraints when converted into slope intercept will be y>= -(x/3) + 7 y>= -(4x/3) + 10 which you said you did, give me a sec and I will graph them
Yeah, that's what I got.
so here is your region to work with
Okay! Now I need to find the ordered pairs?
right, to do that you need to just go through the region and find the pairs. That quite involved though...
I'm kind of confused on how to do that.