Share
Explore BrainMass

Linear Programming

6. Consider the linear programming problem:
max 4x − 3y
x + y <= 5
6x &#8722; 3y <= 12
x, y >= 0
The graph of the constraints is given below with the feasible region shown in grey.

y-axis

x-axis

(a) Determine the coordinates of all four corner points of the feasible region and label them on the
graph.

(b) Find the optimal solution to the linear programming problem. Show your work.

Attachments

Solution Summary

An LP problem is solved.

$2.19