Explore BrainMass

Linear programming: graph constraints, find optimal solution

Solve the following problem graphically.

Max 5X + 6Y
s.t. 17X + 8Y < 136
3X + 4Y < 36
X, Y > 0 and integer

a. Graph the constraints for this problem. Indicate all feasible solutions.
b. Find the optimal solution to the LP Relaxation. Round down to find a feasible integer solution. Is this solution optimal?
c. Find the optimal solution.

Solution Summary

This response provides instructional advice in graphing constraints and solving for the optimal solution.