anonymous
  • anonymous
|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.
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
Are you having issues graphing these equations?
anonymous
  • anonymous
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.
anonymous
  • anonymous
ok so I would graph out your constraints to see how many vertices you have.

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
How do you do that?
anonymous
  • anonymous
|dw:1351370399352:dw|
anonymous
  • anonymous
so if this is a graph of x and y these are the constrants that x >= 0 and y>=0
anonymous
  • anonymous
Okay yeah, that makes sense because you can't go less than 0 (negative numbers).. right?
anonymous
  • anonymous
right
anonymous
  • anonymous
I found the maximum. I got 62.76. Is that right?
anonymous
  • anonymous
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
anonymous
  • anonymous
Yeah, that's what I got.
anonymous
  • anonymous
|dw:1351370707098:dw|
anonymous
  • anonymous
so here is your region to work with
anonymous
  • anonymous
Okay! Now I need to find the ordered pairs?
anonymous
  • anonymous
right, to do that you need to just go through the region and find the pairs. That quite involved though...
anonymous
  • anonymous
I'm kind of confused on how to do that.

Looking for something else?

Not the answer you are looking for? Search for more explanations.