-->

Linear Programming

Question
CBSEENMA12033560

There two types of fertilisers F1 and F2. F1 consists of 10% nitrogen and 6% phosphoric acid and F2 consists of 5% nitrogen and 10% phosphoric acid. After testing the soil conditions, a farmer finds that she needs atleast 14 kg of nitrogen and 14 kg of phosphoric acid for her crop. If F1 costs Rs 6/ kg and F2 costs Rs 5/kg, determine how much of each type of fertiliser should be used so that nutrient requirements are met at a minimum cost. What is the minimum cost?

Solution

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
                  straight x over 10 plus straight y over 20 greater or equal than 14 space space space space or space space 2 straight x plus straight y greater or equal than 280
   6 over 100 straight x plus 10 over 100 straight y space greater or equal than 14 space space space or space space space 3 straight x plus 5 straight y greater or equal than 700
                       straight x greater or equal than 0 comma space space space space straight y greater or equal than 0
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  straight x equals 700 over 3
therefore  line meets OX in straight B open parentheses 700 over 3 comma space 0 close parentheses space and space OY space in space straight M left parenthesis 0 comma space 140 right parenthesis.

Since feasible region satisfies all the constraints.
∴ shaded region is the feasible region which is unbounded and has corner points are 
straight B open parentheses 700 over 3 comma space 0 close parentheses comma space space straight C left parenthesis 100 comma space 80 right parenthesis comma space space straight L left parenthesis 0 comma space 280 right parenthesis.
At space space straight B open parentheses 700 over 3 comma space 0 close parentheses comma space straight Z space equals 6 cross times 700 over 3 plus 5 cross times 0 space equals space 1400 plus 0 space equals space 1400
At space straight C left parenthesis 100 comma space 80 right parenthesis comma space space straight Z space equals space 6 cross times 100 space plus space space 5 cross times 80 space equals space 600 plus 400 space equals space 1000
At space straight L left parenthesis 0 comma space 280 right parenthesis comma space space straight Z space equals space 6 space cross times space 0 plus 5 space cross times 280 space equals space 0 plus 1400 space equals space 1400

∴ 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.