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.

Get our expert's

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions.

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions

Are you having issues graphing these equations?

ok so I would graph out your constraints to see how many vertices you have.

How do you do that?

|dw:1351370399352:dw|

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?

right

I found the maximum. I got 62.76. Is that right?

Yeah, that's what I got.

|dw:1351370707098:dw|

so here is your region to work with

Okay! Now I need to find the ordered pairs?

I'm kind of confused on how to do that.