I really do not know how to do this problem!! solve the given linear programming problem. Maximize z=2x+9y subject to x>=0, y>=0, x+y<=10, 2x+y>=10, x+2y>=10 What is the solution The maximum value of z is z=_____, and it occurs at the point (x,y)=_____
@primeralph could you help me?
know calculus?
ever heard of Lagrange multipliers?
no I haven't heard of it.
Simplex algorithm?
@terenzreignz really? I don't think he/she has.
@flutterflies you can just do it by picking points
Well, in lieu of Simplex, then since this is a linear program, just graph.
Sorry I haven't. the prof doesn't use terms. and picking points??
The optimal solution is always at a vertex of the feasible region...
Anyway.... graphing linear inequalities is the name of the game here.
Let's start with \(\large x+y \le 10\)
yeah, just pick points that fall in and graph or generalize if you have the time
Not just any points, but points at the corners... anyway, let's graph \(\large x+y \le10\) It looks something like this... |dw:1368765202264:dw| Where the (tentative) feasible region is that triangle which you saw formed... (since x and y must both be positive)
Now, superimpose the graph of \(\large 2x+y \ge 10\)
|dw:1368765289662:dw|
And now, our tentative feasible region is this...|dw:1368765378795:dw| (sorry, the draw option has no "fill" tool)
Join our real-time social learning platform and learn together with your friends!