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

question will be attached ... im kind of confused so any explanation will really help me

OpenStudy (anonymous):

OpenStudy (precal):

what course? need to find out what topic this is? Linear Programming perhaps?

OpenStudy (precal):

http://www.purplemath.com/modules/linprog.htm

OpenStudy (anonymous):

its pre calc linear systems

OpenStudy (precal):

Try that link

OpenStudy (precal):

Well it looks like you are missing some other information, looks like a business problem

OpenStudy (anonymous):

ok thank you thats all the problem says though...

OpenStudy (precal):

Somebody really smart proved that, for linear systems like this, the maximum and minimum values of the optimization equation will always be on the corners of the feasibility region. So, to find the solution to this exercise, I only need to plug these three points into "z = 3x + 4y". (2, 6): z = 3(2) + 4(6) = 6 + 24 = 30 (6, 4): z = 3(6) + 4(4) = 18 + 16 = 34 (–1, –3): z = 3(–1) + 4(–3) = –3 – 12 = –15 Then the maximum of z = 34 occurs at (6, 4), and the minimum of z = –15 occurs at (–1, –3). OK, I copied this from that website, it looks like that is what you need

OpenStudy (precal):

the maximum and minimum values of the optimization equation will always be on the corners of the feasibility region. Key part of what you are looking for

OpenStudy (anonymous):

ok thank you! :)

OpenStudy (precal):

Good luck, I would help you but I don't know how to do linear programmin

OpenStudy (anonymous):

28

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!