Explore BrainMass

Linear programming

Use the geometric method of linear programming to maximize the objective function f(x,y)=3x-6y subject to the constraints.
x>= 1
x-y<= 3
2x+y>= 6
2x+y<= 8

Solution Preview

Please see the attachment for the graph of the feasible region. Move the line 3x-6y=0 downward to ...

Solution Summary

This shows how to maximize and objective function with given constraints.