Advertisements
Advertisements
प्रश्न
A dietician wishes to mix together 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 and 8 units of vitamin C. The vitamin contents of one kg food is given below:
| Food | Vitamin A | Vitamin B | Vitamin C |
| X | 1 | 2 | 3 |
| Y | 2 | 2 | 1 |
One kg of food X costs ₹16 and one kg of food Y costs ₹20. Find the least cost of the mixture which will produce the required diet?
उत्तर
Let x kg of food X and y kg of food Y are mixed together to make the mixture.
The cost of food X is ₹16/kg and that of food Y is ₹20/kg. So, x kg of food X and y kg of food Y will cost ₹(16x + 20y).
Since one kg of food X contains 1 unit of vitamin A and one kg of food Y contains 2 units of vitamin A, therefore, x kg of food X and y kg of food Y will contain (x + 2y) units of vitamin A. But, the mixture should contain atleast 10 units of vitamin A.
∴ x + 2y ≥ 10
Similarly, x kg of food X and y kg of food Y will contain (2x + 2y) units of vitamin B. But, the mixture should contain atleast 12 units of vitamin B.
∴ 2x + 2y ≥ 12
⇒ x + y ≥ 6
Also, x kg of food X and y kg of food Y will contain (3x + y) units of vitamin C. But, the mixture should contain atleast 8 units of vitamin C.
∴ 3x + y ≥ 8
Thus, the given linear programming problem is
Minimise Z = 16x + 20y
subject to the constraints
x + 2y ≥ 10
x + y ≥ 6
3x + y ≥ 8
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(10, 0), H(2, 4), G(1, 5) and F(0, 8).
The value of the objective function at these points are given in the following table.
| Corner Point | Z = 16x + 20y |
| (10, 0) | 16 × 10 + 20 × 0 = 160 |
| (2, 4) | 16 × 2 + 20 × 4 = 112 → Minimum |
| (1, 5) | 16 × 1 + 20 × 5 = 116 |
| (0, 8) | 16 × 0 + 20 × 8 = 160 |
The smallest value of Z is 112 which is obtained at (2, 4).
It can be seen that the open half-plane represented by 16x + 20y < 112 has no common points with the feasible region.
So, the minimum value of Z is 112. Hence, the least cost of the mixture which will produce the required diet is ₹112.
APPEARS IN
संबंधित प्रश्न
Minimize `z=4x+5y ` subject to `2x+y>=7, 2x+3y<=15, x<=3,x>=0, y>=0` solve using graphical method.
Minimize :Z=6x+4y
Subject to : 3x+2y ≥12
x+y ≥5
0 ≤x ≤4
0 ≤ y ≤ 4
A retired person wants to invest an amount of Rs. 50, 000. His broker recommends investing in two type of bonds ‘A’ and ‘B’ yielding 10% and 9% return respectively on the invested amount. He decides to invest at least Rs. 20,000 in bond ‘A’ and at least Rs. 10,000 in bond ‘B’. He also wants to invest at least as much in bond ‘A’ as in bond ‘B’. Solve this linear programming problem graphically to maximise his returns.
Minimum and maximum z = 5x + 2y subject to the following constraints:
x-2y ≤ 2
3x+2y ≤ 12
-3x+2y ≤ 3
x ≥ 0,y ≥ 0
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.
A manufacturing company makes two types of teaching aids A and B of Mathematics for class XII. Each type of A requires 9 labour hours for fabricating and 1 labour hour for finishing. Each type of B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available per week are 180 and 30, respectively. The company makes a profit of Rs 80 on each piece of type A and Rs 120 on each piece of type B. How many pieces of type A and type B should be manufactured per week to get maximum profit? Make it as an LPP and solve graphically. What is the maximum profit per week?
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 LPP by graphical method:
Maximize: z = 3x + 5y
Subject to: x + 4y ≤ 24
3x + y ≤ 21
x + y ≤ 9
x ≥ 0, y ≥ 0
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
Solve the following L.P.P. graphically Maximise Z = 4x + y
Subject to following constraints x + y ≤ 50
3x + y ≤ 90,
x ≥ 10
x, y ≥ 0
Minimize Z = 18x + 10y
Subject to
\[4x + y \geq 20\]
\[2x + 3y \geq 30\]
\[ x, y \geq 0\]
Maximize Z = 10x + 6y
Subject to
\[3x + y \leq 12\]
\[2x + 5y \leq 34\]
\[ 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 = −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\]
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 manufacturer makes two types A and B of tea-cups. Three machines are needed for the manufacture and the time in minutes required for each cup on the machines is given below:
| Machines | |||
| I | II | III | |
| A B |
12 6 |
18 0 |
6 9 |
Each machine is available for a maximum of 6 hours per day. If the profit on each cup A is 75 paise and that on each cup B is 50 paise, show that 15 tea-cups of type A and 30 of type B should be manufactured in a day to get the maximum profit.
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 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 man owns a field of area 1000 sq.m. He wants to plant fruit trees in it. He has a sum of Rs 1400 to purchase young trees. He has the choice of two types of trees. Type A requires 10 sq.m of ground per tree and costs Rs 20 per tree and type B requires 20 sq.m of ground per tree and costs Rs 25 per tree. When fully grown, type A produces an average of 20 kg of fruit which can be sold at a profit of Rs 2.00 per kg and type B produces an average of 40 kg of fruit which can be sold at a profit of Rs. 1.50 per kg. How many of each type should be planted to achieve maximum profit when the trees are fully grown? What is 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.
There are two factories located one at place P and the other at place Q. From these locations, a certain commodity is to be delivered to each of the three depots situated at A, B and C. The weekly requirements of the depots are respectively 5, 5 and 4 units of the commodity while the production capacity of the factories at P and Q are respectively 8 and 6 units. The cost of transportation per unit is given below:
| From \ To | Cost (in ₹) | ||
| A | B | C | |
| P | 160 | 100 | 150 |
| Q | 100 | 120 | 100 |
How many units should be transported from each factory to each depot in order that the transportation cost is minimum. What will be the minimum transportation cost?
An aeroplane can carry a maximum of 200 passengers. A profit of ₹1000 is made on each executive class ticket and a profit of ₹600 is made on each economy class ticket. The airline reserves atleast 20 seats for executive class. However, atleast 4 times as many passengers prefer to travel by economy class than by the executive class. Determine how many tickets of each type must be sold in order to maximise the profit of the airline. What is the maximum profit?
Tow godowns, A and B, have grain storage capacity of 100 quintals and 50 quintals respectively. They supply to 3 ration shops, D, E and F, whose requirements are 60, 50 and 40 quintals respectively. The cost of transportation per quintal from the godowns to the shops are given in the following table:
| Transportation cost per quintal(in Rs.) | ||
| From-> | A | B |
| To | ||
| D | 6.00 | 4.00 |
| E | 3.00 | 2.00 |
| F | 2.50 | 3.00 |
How should the supplies be transported in order that the transportation cost is minimum?
The region represented by the inequation system x, y ≥ 0, y ≤ 6, x + y ≤ 3 is
The point at which the maximum value of x + y subject to the constraints x + 2y ≤ 70, 2x + y ≤ 95, x ≥ 0, y ≥ 0 is obtained, is ______.
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 cardigans: type A and type B. It costs ₹ 360 to make a type A cardigan and ₹ 120 to make a type B cardigan. The company can make at most 300 cardigans and spend at most ₹ 72000 a day. The number of cardigans of type B cannot exceed the number of cardigans of type A by more than 200. The company makes a profit of ₹ 100 for each cardigan of type A and ₹ 50 for every cardigan of type B.
Formulate this problem as a linear programming problem to maximize the profit to the company. Solve it graphically and find the maximum profit.
The maximum value of z = 3x + 10y subjected to the conditions 5x + 2y ≤ 10, 3x + 5y ≤ 15, x, y ≥ 0 is ______.
The constraints of an LPP are 7 ≤ x ≤ 12, 8 ≤ y ≤ 13. Determine the vertices of the feasible region formed by them.
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 ____________.
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 objective function Z has both a maximum and a minimum value on R and ____________.
Any point in the feasible region that gives the optional value (maximum or minimum) of the objective function is called:-
The solution set of the inequality 3x + 5y < 4 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 constraints –x1 + x2 ≤ 1, –x1 + 3x2 ≤ 9, x1x2 ≥ 0 define on ______.
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?
