You are on page 1of 1

Given the following linear programming problem

Maximize 40x + 30y


Subject to
x + y < 80
3x + 2y < 180
2x + y > 20
x, y > 0
(a) Graph the constraints.

The obtained graph is given below,

(b) Find the coordinates of each corner point of the feasible region

The corner points are (10,0), (60,0) , (0,20), (0,80) and (20, 60).

(c) Determine the optimal solution.

Optimal solution is, X = 20, Y = 60 and that is giving maximum of 2600

You might also like