Given the system of constraints, anem all the vertices of the feasible region. Then find the maximum value of the given objective function. Objective Function: C = 6x – 4y
your first need to graph the inequalities
okay that'll take me a few minutes
alright post what you get
ideally, using geogebra (not sure if I showed you that program or not) is the best way to do it
alright thats what i got so far
ok one sec
I think i made a mistake I think this is the right one
ok much better
that's a very messy picture, but all 4 graphs overlap to give you this
so are my points (0,0) (0,3)(0,5)(1.5,3.5)??
one sec, gotta check that last point
instead of (0,5), it should be (5,0)
everything else is correct
your four corner points are (0,0), (0,3), (5,0), (1.5,3.5)
do you know what to do from here?
yup give me one sec
ok tell me what you get
the max is the largest value of C that occurs when you plug in each corner point
so -20
if you plug in each corner point you get this
Plug in (x,y) = (0,0) C = 6x - 4y C = 6(0) - 4(0) C = 0 --------------------------------------------- Plug in (x,y) = (0,3) C = 6x - 4y C = 6(0) - 4(3) C = -12 --------------------------------------------- Plug in (x,y) = (5,0) C = 6x - 4y C = 6(5) - 4(0) C = 30 --------------------------------------------- Plug in (x,y) = (1.5,3.5) C = 6x - 4y C = 6(1.5) - 4(3.5) C = -5 --------------------------------------------- Summary: Min is C = -12 which occurs at (0,3) Max is C = 30 which occurs at (5,0)
oh sorry I had 0,5 written down that makes more sense
ok great
Thank you for all your help!
yw
Join our real-time social learning platform and learn together with your friends!