Advertisements
Advertisements
प्रश्न
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?
Advertisements
उत्तर
Let x bags of brand P and y bags of brand Q should be mixed to produce the mixture.
Each bag of brand P costs ₹250 and each bag of brand Q costs ₹200. Therefore, x bags of brand P and y bags of brand Q costs ₹(250x + 200y).
Since each bag of brand P contains 3 units of nutritional element A and each bag of brand Q contains 1.5 units of nutritional element A, therefore, x bag of brand P and y bag of brand Q will contain (3x + 1.5y) units of nutritional element A. But, the minimum requirement of nutrients A is 18 units.
∴ 3x + 1.5y ≥ 18
⇒ 2x + y ≥ 12
Similarly, x bag of brand P and y bag of brand Q will contain (2.5x + 11.25y) units of nutritional element B. But, the minimum requirement of nutrients B is 45 units.
∴ 2.5x + 11.25y ≥ 45
⇒ 2x + 9y ≥ 36
Also, x bag of brand P and y bag of brand Q will contain (2x + 3y) units of nutritional element B. But, the minimum requirement of nutrients C is 24 units.
∴ 2x + 3y ≥ 24
Thus, the given linear programming problem is
Minimise Z = 250x + 200y
subject to the constraints
2x + y ≥ 12
2x + 9y ≥ 36
2x + 3y ≥ 24
x, y ≥ 0
The feasible region determined by the given constraints can be diagrammatically represented as,
The coordinates of the corner points of the feasible region are A(18, 0), B(9, 2), C(3, 6) and D(0, 12).
The value of the objective function at these points are given in the following table.
| Corner Point | Z = 250x + 200y |
| (18, 0) | 250 × 18 + 200 × 0 = 4500 |
| (9, 2) | 250 × 9 + 200 × 2 = 2650 |
| (3, 6) | 250 × 3 + 200 × 6 = 1950 → Minimum |
| (0, 12) | 250 × 0 + 200 × 12 = 2400 |
The smallest value of Z is 1950 which is obtained at (3, 6).
It can be seen that the open half-plane represented by 250x + 200y < 1950 or 5x + 4y < 39 has no common points with the feasible region.
So, 3 bags of brand P and 6 bags of brand Q should be used in the mixture to minimise the cost.
Hence, the minimum cost of the mixture per bag is ₹1950.
APPEARS IN
संबंधित प्रश्न
Minimize `z=4x+5y ` subject to `2x+y>=7, 2x+3y<=15, x<=3,x>=0, y>=0` solve using graphical method.
A cooperative society of farmers has 50 hectares of land to grow two crops A and B. The profits from crops A and B per hectare are estimated as Rs 10,500 and Rs 9,000 respectively. To control weeds, a liquid herbicide has to be used for crops A and B at the rate of 20 litres and 10 litres per hectare, respectively. Further not more than 800 litres of herbicide should be used in order to protect fish and wildlife using a pond which collects drainage from this land. Keeping in mind that the protection of fish and other wildlife is more important than earning profit, how much land should be allocated to each crop so as to maximize the total profit? Form an LPP from the above and solve it graphically. Do you agree with the message that the protection of wildlife is utmost necessary to preserve the balance in environment?
A manufacturer produces two products A 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 Rs 7 profit and B at a profit of Rs 4. Find the production level per day for maximum profit graphically.
Solve the following linear programming problem graphically :
Maximise Z = 7x + 10y subject to the constraints
4x + 6y ≤ 240
6x + 3y ≤ 240
x ≥ 10
x ≥ 0, y ≥ 0
Maximize Z = 3x + 4y
Subject to
\[2x + 2y \leq 80\]
\[2x + 4y \leq 120\]
Minimize Z = 5x + 3y
Subject to
\[2x + y \geq 10\]
\[x + 3y \geq 15\]
\[ x \leq 10\]
\[ y \leq 8\]
\[ 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\]
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\]
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 diet of two foods F1 and F2 contains nutrients thiamine, phosphorous and iron. The amount of each nutrient in each of the food (in milligrams per 25 gms) is given in the following table:
Nutrients |
Food |
F1 | F2 |
| Thiamine | 0.25 | 0.10 |
|
| Phosphorous | 0.75 | 1.50 | |
| Iron | 1.60 | 0.80 | |
The minimum requirement of the nutrients in the diet are 1.00 mg of thiamine, 7.50 mg of phosphorous and 10.00 mg of iron. The cost of F1 is 20 paise per 25 gms while the cost of F2 is 15 paise per 25 gms. Find the minimum cost of diet.
A diet for a sick person must contain at least 4000 units of vitamins, 50 units of minerals and 1400 of calories. Two foods A and B, are available at a cost of Rs 4 and Rs 3 per unit respectively. If one unit of A contains 200 units of vitamin, 1 unit of mineral and 40 calories and one unit of food B contains 100 units of vitamin, 2 units of minerals and 40 calories, find what combination of foods should be used to have the least cost?
A dietician mixes together two kinds of food in such a way that the mixture contains at least 6 units of vitamin A, 7 units of vitamin B, 11 units of vitamin C and 9 units of vitamin D. The vitamin contents of 1 kg of food X and 1 kg of food Y are given below:
| Vitamin A |
Vitamin B |
Vitamin |
Vitamin D |
|
| Food X Food Y |
1 2 |
1 1 |
1 3 |
2 1 |
One kg food X costs Rs 5, whereas one kg of food Y costs Rs 8. Find the least cost of the mixture which will produce the desired diet.
A diet is to contain at least 80 units of vitamin A and 100 units of minerals. Two foods F1and F2 are available. Food F1 costs Rs 4 per unit and F2 costs Rs 6 per unit one unit of food F1 contains 3 units of vitamin A and 4 units of minerals. One unit of food F2contains 6 units of vitamin A and 3 units of minerals. Formulate this as a linear programming problem and find graphically the minimum cost for diet that consists of mixture of these foods and also meets the mineral nutritional requirements
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 firm manufactures two products A and B. Each product is processed on two machines M1 and M2. Product A requires 4 minutes of processing time on M1 and 8 min. on M2 ; product B requires 4 minutes on M1 and 4 min. on M2. The machine M1 is available for not more than 8 hrs 20 min. while machine M2 is available for 10 hrs. during any working day. The products A and B are sold at a profit of Rs 3 and Rs 4 respectively.
Formulate the problem as a linear programming problem and find how many products of each type should be produced by the firm each day in order to get maximum profit.
A chemical company produces two compounds, A and B. The following table gives the units of ingredients, C and D per kg of compounds A and B as well as minimum requirements of C and D and costs per kg of A and B. Find the quantities of A and B which would give a supply of C and D at a minimum cost.
| Compound | Minimum requirement | ||
| A | B | ||
| Ingredient C Ingredient D |
1 3 |
2 1 |
80 75 |
| Cost (in Rs) per kg | 4 | 6 | - |
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 20 minutes available for cutting and 4 hours available for assembling. The profit is 50 paise each for type A and 60 paise each for type B souvenirs. How many souvenirs of each type should the company manufacture in order to maximize the 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 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 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.
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 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 |
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
For L.P.P. maximize z = 4x1 + 2x2 subject to 3x1 + 2x2 ≥ 9, x1 - x2 ≤ 3, x1 ≥ 0, x2 ≥ 0 has ______.
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 ______.
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 ______.
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,
Any point in the feasible region that gives the optional value (maximum or minimum) of the objective function is called:-
The maximum value of z = 5x + 2y, subject to the constraints x + y ≤ 7, x + 2y ≤ 10, x, y ≥ 0 is ______.
The objective function Z = ax + by of an LPP has maximum vaiue 42 at (4, 6) and minimum value 19 at (3, 2). Which of the following is true?
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:
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.
A linear programming problem is given by Z = px + qy, where p, q > 0 subject to the constraints x + y ≤ 60, 5x + y ≤ 100, x ≥ 0 and y ≥ 0.
- Solve graphically to find the corner points of the feasible region.
- If Z = px + qy is maximum at (0, 60) and (10, 50), find the relation of p and q. Also mention the number of optimal solution(s) in this case.
