Advertisements
Advertisements
प्रश्न
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
Advertisements
उत्तर
The given information can tabulated as follows:
| Fertilizer | Nitrogen | Phosphoric Acid | Cost/kg (in ₹) |
| A | 12% | 5% | 10 |
| B | 4% | 5% | 8 |
Let the requirement of fertilizer A by the farmer be x kg and that of B be y kg.
It is given that farmer requires atleast 12 kg of nitrogen and 12 kg of phosphoric acid for his crops.
The inequations thus formed based on the given information are as follows:
\[\frac{12}{100}x + \frac{4}{100}y \geq 12\]
\[ \Rightarrow 12x + 4y \geq 1200\]
\[ \Rightarrow 3x + y \geq 300 . . . . . \left( 1 \right)\]
Also,
\[\frac{5x}{100} + \frac{5y}{100} \geq 12\]
\[ \Rightarrow 5x + 5y \geq 1200\]
\[ \Rightarrow x + y \geq 240 . . . . . \left( 2 \right)\]
Total cost of the fertilizer Z = ₹ (10x + 8y)
Therefore, the mathematical formulation of the given linear programming problem can be stated as:
Minimize Z = 10x + 8y
Subject to the constraints
3x + y ≥ 300 .....(1)
x + y ≥ 240 .....(2)
x ≥ 0, y ≥ 0 .....(3)
The feasible region determined by constraints (1) to (3) is graphically represented as:
Here, it is seen that the feasible region is unbounded. The values of Z at the corner points of the feasible region are represented in tabular form as:
| Corner Point | Z = 10x + 8y |
| A(0, 300) | Z = 10 × 0 + 8 × 300 = 2400 |
| B(30, 210) | Z = 10 × 30 + 8 × 210 = 1980 |
| C(240, 0) | Z = 10 × 240 + 8 × 0 = 2400 |
The open half plane determined by 10x + 8y < 1980 has no point in common with the feasible region. So, the minimum value of Z is 1980.
The minimum value of Z is 1980, which is obtained at x = 30 and y = 210.
Thus, the minimum requirement of fertilizer of type A will be 30 kg and that of type B will be 210 kg.
Also, the total minimum cost of the fertilisers is ₹ 1980.
APPEARS IN
संबंधित प्रश्न
Solve the following LPP by using graphical method.
Maximize : Z = 6x + 4y
Subject to x ≤ 2, x + y ≤ 3, -2x + y ≤ 1, x ≥ 0, y ≥ 0.
Also find maximum value of Z.
A dealer in rural area wishes to purchase a number of sewing machines. He has only Rs 5,760 to invest and has space for at most 20 items for storage. An electronic sewing machine cost him Rs 360 and a manually operated sewing machine Rs 240. He can sell an electronic sewing machine at a profit of Rs 22 and a manually operated sewing machine at a profit of Rs 18. Assuming that he can sell all the items that he can buy, how should he invest his money in order to maximize his profit? Make it as a LPP and solve it graphically.
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
A dietician wishes to mix two kinds ·of food X· and Y in such a way that the mixture contains at least 10 units of vitamin A, 12 units of vitamin B arid 8 units of vitamin C. The vitamin contents of one kg food is given below:
| Food | Vitamin A | Vitamin.B | Vitamin C |
| X | 1 unit | 2 unit | 3 unit |
| Y | 2 unit | 2 unit | 1 unit |
Orie kg of food X costs Rs 24 and one kg of food Y costs Rs 36. Using Linear Programming, find the least cost of the total mixture. which will contain the required vitamins.
Maximize Z = 50x + 30y
Subject to
\[2x + y \leq 18\]
\[3x + 2y \leq 34\]
\[ x, y \geq 0\]
Minimize Z = 2x + 4y
Subject to
\[x + y \geq 8\]
\[x + 4y \geq 12\]
\[x \geq 3, y \geq 2\]
Minimize Z = 3x1 + 5x2
Subject to
\[x_1 + 3 x_2 \geq 3\]
\[ x_1 + x_2 \geq 2\]
\[ x_1 , x_2 \geq 0\]
Maximize Z = −x1 + 2x2
Subject to
\[- x_1 + 3 x_2 \leq 10\]
\[ x_1 + x_2 \leq 6\]
\[ x_1 - x_2 \leq 2\]
\[ x_1 , x_2 \geq 0\]
Show the solution zone of the following inequalities on a graph paper:
\[5x + y \geq 10\]
\[ x + y \geq 6\]
\[x + 4y \geq 12\]
\[x \geq 0, y \geq 0\]
Find x and y for which 3x + 2y is minimum subject to these inequalities. Use a graphical method.
Solve the following LPP graphically:
Maximize Z = 20 x + 10 y
Subject to the following constraints
\[x +\]2\[y \leq\]28
3x+ \[y \leq\]24
\[x \geq\] 2x.
\[y \geq\] 0
A fruit grower can use two types of fertilizer in his garden, brand P and Q. The amounts (in kg) of nirogen, phosphoric acid, potash, and chlorine in a bag of each brand are given in the table. Tests indicates that the garden needs at least 240 kg of phosphoric acid, at least 270 kg of potash and at most 310 kg of chlorine.
| kg per bag | ||
| Brand P | Brand P | |
| Nitrogen | 3 | 3.5 |
| Phosphoric acid | 1 | 2 |
| Potash | 3 | 1.5 |
| Chlorine | 1.5 | 2 |
If the grower wants to minimize the amount of nitrogen added to the garden, how many bags of each brand should be used? What is the minimum amount of nitrogen added in the garden?
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 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?
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 firm makes items A and B and the total number of items it can make in a day is 24. It takes one hour to make an item of A and half an hour to make an item of B. The maximum time available per day is 16 hours. The profit on an item of A is Rs 300 and on one item of B is Rs 160. How many items of each type should be produced to maximize the profit? Solve the problem graphically.
If a young man drives his vehicle at 25 km/hr, he has to spend ₹2 per km on petrol. If he drives it at a faster speed of 40 km/hr, the petrol cost increases to ₹5 per km. He has ₹100 to spend on petrol and travel within one hour. Express this as an LPP and solve the same.
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 manufacturer has three machine I, II, III installed in his factory. Machines I and II are capable of being operated for at most 12 hours whereas machine III must be operated for atleast 5 hours a day. She produces only two items M and N each requiring the use of all the three machines.
The number of hours required for producing 1 unit each of M and N on the three machines are given in the following table:
| Items | Number of hours required on machines | ||
| I | II | III | |
| M | 1 | 2 | 1 |
| N | 2 | 1 | 1.25 |
She makes a profit of ₹600 and ₹400 on items M and N respectively. How many of each item should she produce so as to maximise her profit assuming that she can sell all the items that she produced? What will be the maximum profit?
A manufacturer makes two types of toys A and B. Three machines are needed for this purpose and the time (in minutes) required for each toy on the machines is given below:
| Types of Toys | Machines | ||
| I | II | III | |
| A | 12 | 18 | 6 |
| B | 6 | 0 | 9 |
A small firm manufactures necklaces and bracelets. The total number of necklaces and bracelets that it can handle per day is at most 24. It takes one hour to make a bracelet and half an hour to make a necklace. The maximum number of hours available per day is 16. If the profit on a necklace is Rs 100 and that on a bracelet is Rs 300. Formulate on L.P.P. for finding how many of each should be produced daily to maximize the profit?
It is being given that at least one of each must be produced.
The value of objective function is maximum under linear constraints ______.
A carpenter has 90, 80 and 50 running feet respectively of teak wood, plywood and rosewood which is used to product A and product B. Each unit of product A requires 2, 1 and 1 running feet and each unit of product B requires 1, 2 and 1 running feet of teak wood, plywood and rosewood respectively. If product A is sold for Rs. 48 per unit and product B is sold for Rs. 40 per unit, how many units of product A and product B should be produced and sold by the carpenter, in order to obtain the maximum gross income? Formulate the above as a Linear Programming Problem and solve it, indicating clearly the feasible region in the graph.
A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type A
require 5 minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B require 8 minutes each for cutting and 8 minutes each for assembling. There are 3 hours and 20 minutes available for cutting and 4 hours available for assembling. The profit is Rs. 50 each for type A and Rs. 60 each for type B souvenirs. How many souvenirs of each type should the company manufacture in order to maximize profit? Formulate the above LPP and solve it graphically and also find the maximum profit.
The minimum value of z = 10x + 25y subject to 0 ≤ x ≤ 3, 0 ≤ y ≤ 3, x + y ≥ 5 is ______.
The region XOY - plane which is represented by the inequalities -5 ≤ x ≤ 5, -5 ≤ y ≤ 5 is ______
If 4x + 5y ≤ 20, x + y ≥ 3, x ≥ 0, y ≥ 0, maximum 2x + 3y is ______.
The maximum of z = 5x + 2y, subject to the constraints x + y ≤ 7, x + 2y ≤ 10, x, y ≥ 0 is ______.
Of all the points of the feasible region for maximum or minimum of objective function the points.
In linear programming feasible region (or solution region) for the problem is ____________.
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 ____________.
The feasible region (shaded) for a L.P.P is shown in the figure. The maximum Z = 5x + 7y is ____________.
The constraints –x1 + x2 ≤ 1, –x1 + 3x2 ≤ 9, x1x2 ≥ 0 define on ______.
The feasible region corresponding to the linear constraints of a Linear Programming Problem is given below.
Which of the following is not a constraint to the given Linear Programming Problem?
Solve the following Linear Programming Problem graphically:
Maximize: z = – x + 2y,
Subject to the constraints: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.
Aman has ₹ 1500 to purchase rice and wheat for his grocery shop. Each sack of rice and wheat costs ₹ 180 and Rupee ₹ 120 respectively. He can store a maximum number of 10 bags in his shop. He will earn a profit of ₹ 11 per bag of rice and ₹ 9 per bag of wheat.
- Formulate a Linear Programming Problem to maximise Aman’s profit.
- Calculate the maximum profit.
Which statement defines a feasible solution?
What is called the feasible region?
What is a corner point of a feasible region?
Which description represents an unbounded region?
For \[x+y\leq50\], \[3x+y\leq90\], \[x\geq0\], and \[y\geq0\], which is a corner point of the feasible region?
