Ask your own question, for FREE!
Mathematics 9 Online
OpenStudy (anonymous):

By graphing the system of constraints, find the values of X and Y that minimize the objective function x+2y=>8 x>=2 y>=0 minimum for C=x+3y A. (8,0) B. (2,3) C. (0,10) D. (10,0)

OpenStudy (anonymous):

@amistre64

OpenStudy (amistre64):

did you graph the constraints?

OpenStudy (anonymous):

Yes

OpenStudy (amistre64):

then the points that make up the intersection of your boundaries are?

OpenStudy (anonymous):

Here is the screenshot

OpenStudy (amistre64):

|dw:1445724192316:dw|

OpenStudy (anonymous):

Yes, I know there is the screenshot above It shows the 3 points

OpenStudy (amistre64):

it shows 2 points

OpenStudy (amistre64):

what are the points that make the corners of the feasible region? we can discount the points that are at infinity simply since they make C = infinity is not going to be a minimal amount

OpenStudy (amistre64):

our points are when x=2, or y=0

OpenStudy (anonymous):

Okay, whats next

OpenStudy (amistre64):

what are our points?

OpenStudy (amistre64):

if we know our points, we have values for x and y ... test them in C to see which of them gives us the smallest value for C or course.

OpenStudy (anonymous):

2,3 2,0 8,0

OpenStudy (amistre64):

2,0 is not one of our points

OpenStudy (amistre64):

|dw:1445724775520:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!