मराठी

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]

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

Minimize: Z = 6x + 4y

Subject to the conditions:

3x + 2y ≥ 12,

x + y ≥ 5,

0 ≤ x ≤ 4,

0 ≤ y ≤ 4


Minimize :Z=6x+4y

Subject to : 3x+2y ≥12

x+y ≥5

0 ≤x ≤4

0 ≤ y ≤ 4 


A company manufactures bicycles and tricycles each of which must be processed through machines A and B. Machine A has maximum of 120 hours available and machine B has maximum of 180 hours available. Manufacturing a bicycle requires 6 hours on machine A and 3 hours on machine B. Manufacturing a tricycle requires 4 hours on machine A and 10 hours on machine B.
If profits are Rs. 180 for a bicycle and Rs. 220 for a tricycle, formulate and solve the L.P.P. to determine the number of bicycles and tricycles that should be manufactured in order to maximize the profit.


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


Solve the following LPP by graphical method:

Minimize Z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0


Maximize Z = 50x + 30y
Subject to 

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


Minimize Z = 30x + 20y
Subject to 

\[x + y \leq 8\]
\[ x + 4y \geq 12\]
\[5x + 8y = 20\]
\[ x, y \geq 0\]


Maximize Z = 4x + 3y
Subject to 

\[3x + 4y \leq 24\]
\[8x + 6y \leq 48\]
\[ x \leq 5\]
\[ y \leq 6\]
\[ x, y \geq 0\]


Maximize Z = 3x + 3y, if possible,
Subject to the constraints

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


A farmer mixes two brands P and Q of cattle feed. Brand P, costing ₹250 per bag, contains 2 units of nutritional element A, 2.5 units of element B and 2 units of element C. Brand Q costing ₹200 per bag contains 1.5 units of nutritional element A, 11.25 units of element B and 3 units of element C. The minimum requirements of nutrients A, B and C are 18 units, 45 units and 24 units respectively. Determine the number of bags of each brand which should be mixed in order to produce a mixture having a minimum cost per bag? What is the minimum cost of the mixture per bag?


A company produces two types of goods, A and B, that require gold and silver. Each unit of type A requires 3 gm of silver and 1 gm of gold while that of type B requires 1 gm of silver and 2 gm of gold. The company can produce 9 gm of silver and 8 gm of gold. If each unit of type A brings a profit of Rs 40 and that of type B Rs 50, find the number of units of each type that the company should produce to maximize the profit. What is the maximum profit?


A factory uses three different resources for the manufacture of two different products, 20 units of the resources A, 12 units of B and 16 units of C being available. 1 unit of the first product requires 2, 2 and 4 units of the respective resources and 1 unit of the second product requires 4, 2 and 0 units of respective resources. It is known that the first product gives a profit of 2 monetary units per unit and the second 3. Formulate the linear programming problem. How many units of each product should be manufactured for maximizing the profit? Solve it graphically.


A firm manufactures two types of products A and B and sells them at a profit of Rs 5 per unit of type A and Rs 3 per unit of type B. Each product is processed on two machines M1 and M2. One unit of type A requires one minute of processing time on M1 and two minutes of processing time on M2, whereas one unit of type B requires one minute of processing time on M1 and one minute on M2. Machines M1 and M2 are respectively available for at most 5 hours and 6 hours in a day. Find out how many units of each type of product should the firm produce a day in order 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 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.


 Maximize: z = 3x + 5y  Subject to

x +4y ≤ 24                3x + y  ≤ 21 

x + y ≤ 9                     x ≥ 0 , y ≥0


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.


The graph of the inequality 3X − 4Y ≤ 12, X ≤ 1, X ≥ 0, Y ≥ 0 lies in fully in


The minimum value of z = 10x + 25y subject to 0 ≤ x ≤ 3, 0 ≤ y ≤ 3, x + y ≥ 5 is ______.


For L.P.P. maximize z = 4x1 + 2x2 subject to 3x1 + 2x2 ≥ 9, x1 - x2 ≤ 3, x1 ≥ 0, x2 ≥ 0 has ______.


The constraints of an LPP are 7 ≤ x ≤ 12, 8 ≤ y ≤ 13. Determine the vertices of the feasible region formed by them.


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 ______ 


If 4x + 5y ≤ 20, x + y ≥ 3, x ≥ 0, y ≥ 0, maximum 2x + 3y is ______.


The minimum value of z = 7x + 9y subject to 3x + y ≤ 6, 5x + 8y ≤ 40, x ≥ 0, y ≥ 2 is ______.


Corner points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px + qy, where p, q > 0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1, 1) is ______.


A set of values of decision variables which satisfies the linear constraints and nn-negativity conditions of an L.P.P. is called its ____________.


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


The maximum value of Z = 3x + 4y subjected to contraints x + y ≤ 40, x + 2y ≤ 60, x ≥ 0 and y ≥ 0 is ____________.


The comer point of the feasible region determined by the following system of linear inequalities:

2x + y ≤ 10, x + 3y ≤ 15, x, y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let x = Px + qx where P, q > 0 condition on P and Q so that the maximum of z occurs at both (3, 4) and (0, 5) is


The corner points of the shaded unbounded feasible region of an LPP are (0, 4), (0.6, 1.6) and (3, 0) as shown in the figure. The minimum value of the objective function Z = 4x + 6y occurs at ______.


The maximum value of z = 5x + 2y, subject to the constraints x + y ≤ 7, x + 2y ≤ 10, x, y ≥ 0 is ______.


The maximum value of 2x + y subject to 3x + 5y ≤ 26 and 5x + 3y ≤ 30, x ≥ 0, y ≥ 0 is ______.


The objective function Z = x1 + x2, subject to the constraints are x1 + x2 ≤ 10, – 2x1 + 3x2 ≤ 15, x1 ≤ 6, x1, x2 ≥ 0, has maximum value ______ of the feasible region.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×