Solve the following L.P.P. graphically:
Minimise ![]()
Subject to ![]()
Constraints ![]()
![]()
and ![]()
Given; z = 5x + 10y
x + 2y ≤ 120
x + y ≥ 60
x − 2y ≥ 0
x, y ≥ 0

The boundary points are
(60,30),(40,20),(60,0) and (120,0)
At (60,30)
z = 600
At (40,20)
z = 400
At (120,0)
z = 600
At (60,0)
z = 300
∴ The minimum value of z is 300 at (60,0)
Couldn't generate an explanation.
Generated by AI. May contain inaccuracies — always verify with your textbook.
![[ ccc 1&-1&2 0&2&-3 3&-2&4 ] [ ccc -2&0&1 9&2&-3 6&1&-2 ]](https://static.philoid.co/ncertusercontent/solutions/?domain=gF&l=PROJ28289/1553499714184618.png)

