Pwease help me I feel like an idiot. I'm doing Linear Programming for precalculus and I need help with this problem x ≥ 0 y≥ 0 x + 2y ≤ 10 x + y ≤ 7 I graphed them and found the intersections to be at (0,5) (0,7) (4,3) (7,0) (10,0) Now this is what I can't figure out: Find, if possible, an objective function of the form z = ax + by that has a maximum at the indicated vertex of the region... a) Maximum at (0,5) b) Maximum at (4,3) c) Maximum at (7,0) d) Maximum at (0,0) Basically its asking that I need to come up with values for a and b, that make the given maximum the largest value of Z. So for a), Z needs to be greatest when (0,5) is plugged in for x and y, and the other intersections should all be less. A and B can be anything, it just needs to agree with the maximums they want. No matter what I use for a and b, I cannot get the maximum for the correct one! Help??? Its due tomorrow and if I don't do it by then I'll be..... [video=youtube_share;TMtmxi2q05U]http://youtu.be/TMtmxi2q05U[/video]
Precalc ain't my thing. Stuck in geometry, unfortunately. Sorry, I can't help. I don't know any math whizzes on here besides _Jenna, and she's long gone. *sniff*
I need to use values of a and b to get the maximum value. So for question a). z must be the largest when I plug in z = a(0) + b(5). a and b can be ANYTHING, it just needs to make z the largest value out of the other choices.
