Linear Programming
Linear Programming
Let us draw the graph of the system of inequalities (1) to (3). The feasible region
OABC is shown (shaded) in the Fig 12.8. Observe that the feasible region is bounded.
The coordinates of the corner points O, A, B and C are (0, 0), (40, 0), (30, 20) and
(0, 50) respectively. Let us evaluate the objective function Z = 10500 x + 9000y at
these vertices to find which one gives the maximum profit.
Hence, the society will get the maximum profit of Rs 4,95,000 by allocating 30
hectares for crop X and 20 hectares for crop Y.