Solve the following linear programming problem graphically :
Maximize
subject to the constraints
we have , Maximize
subject to constraints :
converting the given inequalties into equations, we obtain the following equations:
x | 0 | 60 |
y | 40 | 0 |
x | 0 | 40 |
y | 80 | 0 |
x = 10 is a line parallel to y axis
Corner points value of Z = 7x+10y
D(40,0) 7(40)+10(0) = 280
E(30,20) 7(30)+10(20) = 410
F(10,200/6) 7(10)+10(200/6) = 403.33
G(10,0) 7(10)+10(0) = 70
Plotting there points on the graph we get the shaded feasible region ie DEFQD.
clearly the maximum value of z is 410 at (30,20)