Maximise
subject to the constraints
Solve the above LPP graphically.
given, Maximize
subject to constraints :
converting the in equations into equations we obtain the lines
|
Then
x | 0 | 100 |
y | 50 | 0 |
x | 10 | 20 |
y | 20 | 40 |
x | 0 | 100 |
y | 200 | 0 |
Plotting there points on the graph, we get the shaded feasible region ie ADFEA