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

Please help! (: Sketch the region of feasible points and solve the linear programming problem. Maximize C = -3x + 2y, subject to: x ≥ 0 y ≥ 3 x + 3y ≤18 x + y ≥8

OpenStudy (amistre64):

graoh the lines, and find the points of intersection

OpenStudy (amistre64):

the points of intersection will be criticla points to test in your C function

OpenStudy (amistre64):

|dw:1369927207004:dw| looks about right, but these eyes are old and tired

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!