Question

5. The maximum value of Z = 4x + 3y subjected to the constraints 3 x + 2 y 160, 5 x + 2 y> 200, x + 2 y> 80; x, y > 0 is
ans

​

Answer 1

First, plot the lines given and then shade the region that satisfies all the given inequalities. This is the feasible region. It can be seen that the feasible region is unbounded. (Figure- 1)

By solving the equations of the lines, the corner points can be seen to be: (0,100),(20,50),(40,20),(80,0)

According to the Theorem of Linear Programming, if a maximum exists, it must be at one of the corner points.

Evaluating z=4x+3y at the corner points gives:

(x,y)          z

(0,100)      300

(20,50)      230

(40,20)      220

(80,0)        320  ← Maximum

As the feasible region is unbounded, we must check whether the maximum obtained above is in fact a maximum. For that we must plot 4x+3y>320

As plotted in Figure-2, it can be seen that this does have common points with the feasible region. This means that there is no maximum.