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
संबंधित प्रश्न
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.
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?
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 = 4x + 3y
subject to
\[3x + 4y \leq 24\]
\[8x + 6y \leq 48\]
\[ x \leq 5\]
\[ y \leq 6\]
\[ x, y \geq 0\]
Minimize Z = 2x + 4y
Subject to
\[x + y \geq 8\]
\[x + 4y \geq 12\]
\[x \geq 3, y \geq 2\]
To maintain one's health, a person must fulfil certain minimum daily requirements for the following three nutrients: calcium, protein and calories. The diet consists of only items I and II whose prices and nutrient contents are shown below:
| Food I | Food II | Minimum daily requirement | |
| Calcium Protein Calories |
10 5 2 |
4 6 6 |
20 20 12 |
| Price | Rs 0.60 per unit | Rs 1.00 per unit |
Find the combination of food items so that the cost may be minimum.
A manufacturer has three machines installed in his factory. machines I and II are capable of being operated for at most 12 hours whereas Machine III must operate at least for 5 hours a day. He produces only two items, each requiring the use of three machines. The number of hours required for producing one unit each of the items on the three machines is given in the following table:
| Item | Number of hours required by the machine | ||
A B |
I | II | III |
| 1 2 |
2 1 |
1 5/4 |
|
He makes a profit of Rs 6.00 on item A and Rs 4.00 on item B. Assuming that he can sell all that he produces, how many of each item should he produces so as to maximize his profit? Determine his maximum profit. Formulate this LPP mathematically and then solve it.
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 firm manufacturing two types of electric items, A and B, can make a profit of Rs 20 per unit of A and Rs 30 per unit of B. Each unit of A requires 3 motors and 4 transformers and each unit of B requires 2 motors and 4 transformers. The total supply of these per month is restricted to 210 motors and 300 transformers. Type B is an export model requiring a voltage stabilizer which has a supply restricted to 65 units per month. Formulate the linear programing problem for maximum profit and solve it graphically.
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 of product A and 16 of product B. A working week consists of 40 hours of production and weekly turnover must not be less than Rs 10000. If the profit on each of product A is Rs 20 and on product B is Rs 30, then how many of each should be produced so that the profit is maximum. Also, find the maximum profit.
Anil wants to invest at most Rs 12000 in Saving Certificates and National Saving Bonds. According to rules, he has to invest at least Rs 2000 in Saving Certificates and at least Rs 4000 in National Saving Bonds. If the rate of interest on saving certificate is 8% per annum and the rate of interest on National Saving Bond is 10% per annum, how much money should he invest to earn maximum yearly income? Find also his maximum yearly income.
A producer has 30 and 17 units of labour and capital respectively which he can use to produce two type of goods x and y. To produce one unit of x, 2 units of labour and 3 units of capital are required. Similarly, 3 units of labour and 1 unit of capital is required to produce one unit of y. If x and y are priced at Rs 100 and Rs 120 per unit respectively, how should be producer use his resources to maximize the total revenue? Solve the problem graphically.
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 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 manufacturing company makes two models A and B of a product. Each piece of model A requires 9 labour hours for fabricating and 1 labour hour for finishing. Each piece of model B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of ₹8000 on each piece of model A and ₹12000 on each piece of model B. How many pieces of model A and model B should be manufactured per week to realise a maximum profit? What is the maximum profit per week?
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 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?
The region represented by the inequation system x, y ≥ 0, y ≤ 6, x + y ≤ 3 is
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 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 region XOY - plane which is represented by the inequalities -5 ≤ x ≤ 5, -5 ≤ y ≤ 5 is ______
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.
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 linear programming feasible region (or solution region) for the problem is ____________.
In Corner point method for solving a linear programming problem the first step is to ____________.
The feasible region (shaded) for a L.P.P is shown in the figure. The maximum Z = 5x + 7y is ____________.
Solve the following Linear Programming Problem graphically:
Maximize Z = 400x + 300y subject to x + y ≤ 200, x ≤ 40, x ≥ 20, y ≥ 0
The maximum value of z = 5x + 2y, subject to the constraints x + y ≤ 7, x + 2y ≤ 10, x, y ≥ 0 is ______.
The shaded part of given figure indicates in feasible region, then the constraints are:
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.
If x – y ≥ 8, x ≥ 3, y ≥ 3, x ≥ 0, y ≥ 0 then find the coordinates of the corner points of the feasible region.
