Let the farmer use x kg of F1Â and y kg of F2.
Let Z be minimum cost.
Table
Â
We are to minimise
Z = 6x + 5y
subject to constraints
         Â
 Â
           Â
Consider a set of rectangular cartesian axes OXY in the plane.
It is clear that any point which satisfies x ≥ 0, y ≥ 0 lies in the first quadrant.
Now we draw the graph of 2 x + y = 280
For x = 0, y = 280
For y = 0, 2 x = 280 or x = 140
∴  line meets OX in A(140, 0) and OY in L(0, 280).
Again we draw the graph of 3x + 5y = 700
For x = 0,  5y = 700  or  y = 140
For y = 0, Â 3x = 700 Â or Â
 line meets OX inÂ
Since feasible region satisfies all the constraints.
∴ shaded region is the feasible region which is unbounded and has corner points areÂ
∴ smallest value = 1000 at (100, 80)
Since feasible region is unbounded.
∴ we are to check whether this value is minimum.
For this we draw the graph of
6x + 5y <Â 1000 Â Â Â ...(1)
Since (1) has no common point with feasible region.
∴ minimum value = Rs. 1000 at (100, 80)
∴ minimum cost is Rs. 1000 when 100 kg. of fertilizer F1 and 80 kg. of fertilizer F2 are used.
A diet is to contain at least 80 units of vitamin A and 100 units of minerals. Two foods F1 and F2 are available. Food F1 costs Rs 4 per unit food and F2 costs Rs 6 per unit. One unit of food F2 contains 3 units of vitamin A and 4 units of minerals. One unit of food F2 contains 6 units of vitamin A and 3 units of minerals. Formulate this as a linear programming problem. Find the minimum cost for diet that consists of mixture of these two foods and also meets the minimal nutritional requirements.