Linear Programming

We are given an LPP (Linear Programming Problem) where the objective is to maximize under constraints.
To solve it, we identify the feasible region determined by the constraints:
, , and .
Find points of intersection (vertices) of the feasible region:
1. Intersection of and :
Solving, , substitute in second:
point (20, 20)
2. : then from and
So, point (0, 0) and (0, 30) lie on the boundary.
3. : from and
So, point (40, 0) is valid.
Now evaluate at all corner points:
At (0,0):
At (0,30):
At (20,20):
At (40,0):
Wait: let's double-check. One corner is missed.
Intersection of and already gave (20,20)
Another key point: where intersects (60,0)
But (40,0) is more limiting.
So max is at (20,20)
Final correction: Correct Answer: (B) 140