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)
@amistre64
did you graph the constraints?
Yes
then the points that make up the intersection of your boundaries are?
Here is the screenshot
|dw:1445724192316:dw|
Yes, I know there is the screenshot above It shows the 3 points
it shows 2 points
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
our points are when x=2, or y=0
Okay, whats next
what are our points?
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.
2,3 2,0 8,0
2,0 is not one of our points
|dw:1445724775520:dw|
Join our real-time social learning platform and learn together with your friends!