हिंदी

A gardener has supply of fertilizer of type I which consists of 10% nitrogen and 6% phosphoric acid and type II fertilizer which consists of 5% nitrogen and 10% phosphoric acid. - Mathematics

Advertisements
Advertisements

प्रश्न

A gardener has supply of fertilizer of type I which consists of 10% nitrogen and 6% phosphoric acid and type II fertilizer which consists of 5% nitrogen and 10% phosphoric acid. After testing the soil conditions, he finds that he needs at least 14 kg of nitrogen and 14 kg of phosphoric acid for his crop. If the type I fertilizer costs 60 paise per kg and type II fertilizer costs 40 paise per kg, determine how many kilograms of each fertilizer should be used so that nutrient requirements are met at a minimum cost. What is the minimum cost?

योग
Advertisements

उत्तर

Let x kg of type I fertilizer and y kg of type II fertilizer are supplied.
Quantity of fertilizer cannot be negative.
Therefore, \[x, y \geq 0\]

A gardener has supply of fertilizer of type I which consists of 10% nitrogen and type II fertilizer consists of 5% nitrogen and he needs at least 14 kg of nitrogen for his crop.\[\frac{10x}{100} + \frac{5x}{100} \geq 14 \Rightarrow 10x + 5x \geq 1400\]

A gardener has supply of fertilizer of type I which consists 6% phosphoric acid and type II fertilizer consists of 10% phosphoric acid.
And he needs  14 kg of phosphoric acid for his crop.

\[\frac{6x}{100} + \frac{10x}{100} \geq 14 \Rightarrow 6x + 10x \geq 1400\]

Therefore, according to the question, constraints are  

\[10x + 5y \geq 1400\]

\[6x + 10y \geq 1400\]

If the type I fertilizer costs 60 paise per kg and type II fertilizer costs 40 paise per kg.Therefore, cost of x kg of type I fertilizer and y kg of type II fertilizer is Rs 0.60x and Rs 0.40yrespectively.
Total cost = Z =\[0 . 60x + 0 . 40y\]  which is to be minimised.
Thus, the mathematical formulat​ion of the given linear programmimg problem is 
Min Z =  \[0 . 60x + 0 . 40y\]subject to
\[6x + 10y \geq 1400\]
\[10x + 5y \geq 1400\]
\[x, y \geq 0\]
First we will convert inequations into equations as follows:
6x + 10y = 1400, 10x + 5y = 1400, x = 0 and y = 0

Region represented by 6x + 10y ≥ 1400:
The line 6x + 10y = 1400 meets the coordinate axes at
\[A\left( \frac{700}{3}, 0 \right)\]  and B(0, 140) respectively. By joining these points we obtain the line
6x + 10y = 1400. Clearly (0,0) does not satisfies the 6x + 10y = 1400. So, the region which does not contain the origin represents the solution set of the inequation 6x + 10y≥1400.

Region represented by 10x + 5y ≥ 1400:
The line 10x + 5y = 1400 meets the coordinate axes at C(140, 0) and \[D\left( 0, 280 \right)\] respectively. By joining these points we obtain the line 10x + 5y = 1400. Clearly (0,0) does not satisfies the inequation 10x + 5y ≥ 1400. So,the region which does not contain the origin represents the solution set of the inequation 10x + 5y ≥ 1400.

Region represented by ≥ 0 and y ≥ 0:
Since, every point in the first quadrant satisfies these inequations. So, the first quadrant is the region represented by the inequations x ≥ 0, and y ≥ 0.
The feasible region determined by the system of constraints 6x + 10y ≥1400, 10x + 5y ≥ 1400, x ≥ 0 and y ≥ 0 are as follows.

The corner points are D(0, 280), E(100, 80) and \[A\left( \frac{700}{3}, 0 \right)\] The values of Z at these corner points are as follows
Corner point Z= 0.60+ 0.40y
D 112
E 92
A 140

The minimum value of Z is Rs 92 which is attained at E(100, 80).
Thus, the minimum cost is Rs 92 obtained when 100 kg of type I fertilizer and 80 kg of type II fertilizer were supplied.
shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 30: Linear programming - Exercise 30.4 [पृष्ठ ५३]

APPEARS IN

आरडी शर्मा Mathematics [English] Class 12
अध्याय 30 Linear programming
Exercise 30.4 | Q 23 | पृष्ठ ५३

वीडियो ट्यूटोरियलVIEW ALL [1]

संबंधित प्रश्न

Find graphically, the maximum value of z = 2x + 5y, subject to constraints given below :

2x + 4y  83

x + y  6

x + y  4

x  0, y 0


Solve the following L. P. P. graphically:Linear Programming

Minimize Z = 6x + 2y

Subject to

5x + 9y ≤ 90

x + y ≥ 4

y ≤ 8

x ≥ 0, y ≥ 0


Maximize Z = 10x + 6y
Subject to

\[3x + y \leq 12\]
\[2x + 5y \leq 34\]
\[ x, y \geq 0\]


Minimize Z = x − 5y + 20
Subject to

\[x - y \geq 0\]
\[ - x + 2y \geq 2\]
\[ x \geq 3\]
\[ y \leq 4\]
\[ x, y \geq 0\]


Maximize Z = 3x + 5y
Subject to

\[x + 2y \leq 20\]
\[x + y \leq 15\]
\[ y \leq 5\]
\[ x, y \geq 0\]


Maximize Z = 3x1 + 4x2, if possible,
Subject to the constraints 

\[x_1 - x_2 \leq - 1\]

\[ - x_1 + x_2 \leq 0\]

\[ x_1 , x_2 \geq 0\]


Solved the following linear programming problem graphically:
Maximize Z = 60x + 15y
Subject to constraints

\[x + y \leq 50\]
\[3x + y \leq 90\]
\[ x, y \geq 0\]


Find graphically, the maximum value of Z = 2x + 5y, subject to constraints given below:

2x + 4y ≤ 8

3x + y ≤ 6

x + y ≤ 4 

x ≥ 0, y ≥ 0   


One kind of cake requires 300 gm of flour and 15 gm of fat, another kind of cake requires 150 gm of flour and 30 gm of fat. Find the maximum number of cakes which can be made from 7.5 kg of flour and 600 gm of fat, assuming that there is no shortage of the other ingradients used in making the cake. Make it as an LPP and solve it graphically.


A dietician has to develop a special diet using two foods P and Q. Each packet (containing 30 g) of food P contains 12 units of calcium, 4 units of iron, 6 units of cholesterol and 6 units of vitamin A. Each packet of the same quantity of food Q contains 3 units of calcium, 20 units of iron, 4 units of cholesterol and 3 units of vitamin A. The diet requires atleast 240 units of calcium, atleast 460 units of iron and at most 300 units of cholesterol. How many packets of each food should be used to minimise the amount of vitamin A in the diet? What is the minimum of vitamin A.


A company produces two types of leather belts, say type A and B. Belt A is a superior quality and belt B is of a lower quality. Profits on each type of belt are Rs 2 and Rs 1.50 per belt, respectively. Each belt of type A requires twice as much time as required by a belt of type B. If all belts were of type B, the company could produce 1000 belts per day. But the supply of leather is sufficient only for 800 belts per day (both A and B combined). Belt A requires a fancy buckle and only 400 fancy buckles are available for this per day. For belt of type B, only 700 buckles are available per day.
How should the company manufacture the two types of belts in order to have a maximum overall profit?


A factory owner purchases two types of machines, A and B, for his factory. The requirements and limitations for the machines are as follows:

  Area occupied by the
machine
Labour force for each
machine
Daily output in
units
Machine A
Machine B
1000 sq. m
1200 sq. m
12 men
8 men
60
40

He has an area of 7600 sq. m available and 72 skilled men who can operate the machines.
How many machines of each type should he buy to maximize the daily output?


A manufacturer of Furniture makes two products : chairs and tables. processing of these products is done on two machines A and B. A chair requires 2 hrs on machine A and 6 hrs on machine B. A table requires 4 hrs on machine A and 2 hrs on machine B. There are 16 hrs of time per day available on machine A and 30 hrs on machine B. Profit gained by the manufacturer from a chair and a table is Rs 3 and Rs 5 respectively. Find with the help of graph what should be the daily production of each of the two products so as to maximize his profit.


A manufacturer of patent medicines is preparing a production plan on medicines, A and B. There are sufficient raw materials available to make 20000 bottles of A and 40000 bottles of B, but there are only 45000 bottles into which either of the medicines can be put. Further, it takes 3 hours to prepare enough material to fill 1000 bottles of A, it takes 1 hour to prepare enough material to fill 1000 bottles of B and there are 66 hours available for this operation. The profit is Rs 8 per bottle for A and Rs 7 per bottle for B. How should the manufacturer schedule his production in order to maximize his profit?


A small firm manufacturers items A and B. The total number of items A and B that it can manufacture in a day is at the most 24. Item A takes one hour to make while item B takes only half an hour. The maximum time available per day is 16 hours. If the profit on one unit of item A be Rs 300 and one unit of item B be Rs 160, how many of each type of item be produced to maximize the profit? Solve the problem graphically.


A company manufactures two articles A and B. There are two departments through which these articles are processed: (i) assembly and (ii) finishing departments. The maximum capacity of the first department is 60 hours a week and that of other department is 48 hours per week. The product of each unit of article A requires 4 hours in assembly and 2 hours in finishing and that of each unit of B requires 2 hours in assembly and 4 hours in finishing. If the profit is Rs 6 for each unit of A and Rs 8 for each unit of B, find the number of units of A and B to be produced per week in order to have maximum profit.


A manufacturer makes two products, A and B. Product A sells at Rs 200 each and takes 1/2 hour to make. Product B sells at Rs 300 each and takes 1 hour to make. There is a permanent order for 14 units of product A and 16 units of product B. A working week consists of 40 hours of production and the weekly turn over must not be less than Rs 10000. If the profit on each of product A is Rs 20 and an product B is Rs 30, then how many of each should be produced so that the profit is maximum? Also find the maximum profit.

 


A library has to accommodate two different types of books on a shelf. The books are 6 cm and 4 cm thick and weigh 1 kg and  \[1\frac{1}{2}\] kg each respectively. The shelf is 96 cm long and atmost can support a weight of 21 kg. How should the shelf be filled with the books of two types in order to include the greatest number of books? Make it as an LPP and solve it graphically.

 


A merchant plans to sell two types of personal computers a desktop model and a portable model that will cost Rs 25,000 and Rs 40,000 respectively. He estimates that the total monthly demand of computers will not exceed 250 units. Determine the number of units of each type of computers which the merchant should stock to get maximum profit if he does not want to invest more than Rs 70 lakhs and his profit on the desktop model is Rs 4500 and on the portable model is Rs 5000. Make an LPP and solve it graphically.


A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of machine time and 3 hours of craftman's time in its making while a cricket bat takes 3 hours of machine time and 1 hour of craftman's time. In a day, the factory has the availability of not more than 42 hours of machine time and 24 hours of craftman's time.
(i) What number of rackets and bats must be made if the factory is to work at full capacity?
(ii) If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively, find the maximum profit of the factory when it works at full capacity.


A manufacturer considers that men and women workers are equally efficient and so he pays them at the same rate. He has 30 and 17 units of workers (male and female) and capital respectively, which he uses to produce two types of goods A and B. To produce one unit of A, 2 workers and 3 units of capital are required while 3 workers and 1 unit of capital is required to produce one unit of B. If A and B are priced at ₹100 and ₹120 per unit respectively, how should he use his resources to maximise the total revenue? Form the above as an LPP and solve graphically. Do you agree with this view of the manufacturer that men and women workers are equally efficient and so should be paid at the same rate?


A manufacturer produces two products and B. Both the products are processed on two different machines. The available capacity of first machine is 12 hours and that of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at ₹7 profit and that of at a profit of ₹4. Find the production level per day for maximum profit graphically.


 There are two types of fertilisers 'A' and 'B' . 'A' consists of 12% nitrogen and 5% phosphoric acid whereas 'B' consists of 4% nitrogen and 5% phosphoric acid. After testing the soil conditions, farmer finds that he needs at least 12 kg of nitrogen and 12 kg of phosphoric acid for his crops. If 'A' costs ₹10 per kg and 'B' cost ₹8 per kg, then graphically determine how much of each type of fertiliser should be used so that nutrient requiremnets are met at a minimum cost


A company manufactures two types of products A and B. Each unit of A requires 3 grams of nickel and 1 gram of chromium, while each unit of B requires 1 gram of nickel and 2 grams of chromium. The firm can produce 9 grams of nickel and 8 grams of chromium. The profit is ₹ 40 on each unit of the product of type A and ₹ 50 on each unit of type B. How many units of each type should the company manufacture so as to earn a maximum profit? Use linear programming to find the solution.


A manufacturer has employed 5 skilled men and 10 semi-skilled men and makes two models A and B of an article. The making of one item of model A requires 2 hours of work by a skilled man and 2 hours work by a semi-skilled man. One item of model B requires 1 hour by a skilled man and 3 hours by a semi-skilled man. No man is expected to work more than 8 hours per day. The manufacturer's profit on an item of model A is ₹ 15 and on an item of model B is ₹ 10. How many items of each model should be made per day in order to maximize daily profit? Formulate the above LPP and solve it graphically and find the maximum profit.


Find the feasible solution of linear inequation 2x + 3y ≤ 12, 2x + y ≤ 8, x ≥ 0, y ≥ 0 by graphically


Find the solution set of inequalities 0 ≤ x ≤ 5, 0 ≤ 2y ≤ 7


The point which provides the solution to the linear programming problem: Max P = 2x + 3y subject to constraints: x ≥ 0, y ≥ 0, 2x + 2y ≤ 9, 2x + y ≤ 7, x + 2y ≤ 8, is ______ 


Z = 20x1 + 20x2, subject to x1 ≥ 0, x2 ≥ 0, x1 + 2x2 ≥ 8, 3x1 + 2x2 ≥ 15, 5x1 + 2x2 ≥ 20. The minimum value of Z occurs at ____________.


In linear programming feasible region (or solution region) for the problem is ____________.


Let R be the feasible region (convex polygon) for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to constraints described by linear inequalities,


Let R be the feasible region for a linear programming problem, and let Z = ax + by be the objective function. If R is bounded, then ____________.


In Corner point method for solving a linear programming problem the first step is to ____________.


The corner points of the bounded feasible region of a LPP are A(0,50), B(20, 40), C(50, 100) and D(0, 200) and the objective function is Z = x + 2y. Then the maximum value is ____________.


Minimise z = – 3x + 4y subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0 What will be the minimum value of z ?


Any point in the feasible region that gives the optional value (maximum or minimum) of the objective function is called:-


Solve the following Linear Programming problem graphically:

Maximize: Z = 3x + 3.5y

Subject to constraints:

x + 2y ≥ 240,

3x + 1.5y ≥ 270,

1.5x + 2y ≤ 310,

x ≥ 0, y ≥ 0.


Solve the following Linear Programming Problem graphically.

Maximise Z = 5x + 2y subject to:

x – 2y ≤ 2,

3x + 2y ≤ 12,

– 3x + 2y ≤ 3,

x ≥ 0, y ≥ 0


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×