Solve the following linear programming problem graphically :
Maximise
under the following constraints
we have, Maximize
subject to the constraints:
converting the given inequalities into equations we obtain the following equations
is
x | 0 | 300 |
y | 300 | 0 |
x | 0 | 35 |
y | 0 |
ploting there points on the graph, we get the shaded fearible region ie OCDO
corner point value of
O (0,0) 34(0) + 45(0) = 0
C (35,0) 34(35)+45(0) = 1190
D(0,70/3) 34(0)+45(70/3) = 1050
Clearly the maximum value of Z is 1190 at (35,0)