Advertisements
Advertisements
प्रश्न
A manufacturer produces two types of steel trunks. He has two machines A and B. For completing, the first types of the trunk requires 3 hours on machine A and 3 hours on machine B, whereas the second type of the trunk requires 3 hours on machine A and 2 hours on machine B. Machines A and B can work at most for 18 hours and 15 hours per day respectively. He earns a profit of Rs 30 and Rs 25 per trunk of the first type and the second type respectively. How many trunks of each type must he make each day to make maximum profit?
Advertisements
उत्तर
Let x trunks of first type and y trunks of second type were manufactured.
Number of trunks cannot be negative.Therefore,
According to question, the given information can be tabulated as
| Machine A(hrs) | Machine B(hrs) | |
| First type(x) | 3 | 3 |
| Second type(y) | 3 | 2 |
| Availability | 18 | 15 |
Therefore, the constraints are
\[3x + 3y \leq 18\]
\[3x + 2y \leq 15\]
He earns a profit of Rs 30 and Rs 25 per trunk of the first type and the second type respectively.Therefore, profit gained by him from x trunks of first type and y trunks of second type is Rs 30x and Rs 25y respectively.
Total profit = Z = \[30x + 25y\]
which is to be maximised
Thus, the mathematical formulation of the given linear programmimg problem is
Max Z = \[30x + 25y\]
subject to
\[3x + 3y \leq 18\]
\[3x + 2y \leq 15\]
\[x, y \geq 0\]
First we will convert inequations into equations as follows:
3x + 3y = 18, 3x + 2y = 15, x = 0 and y = 0
Region represented by 3x + 3y ≤ 18:
The line 3x + 3y = 18 meets the coordinate axes at A1(6, 0) and B1(0, 6) respectively. By joining these points we obtain the line 3x + 3y = 18. Clearly (0,0) satisfies the 3x + 3y = 18. So, the region which contains the origin represents the solution set of the inequation 3x + 3y ≤ 18.
Region represented by 3x + 2y ≤ 15:
The line 3x + 2y = 15 meets the coordinate axes at C1(5, 0) and \[D_1 \left( 0, \frac{15}{2} \right)\] respectively. By joining these points we obtain the line 3x + 2y = 15. Clearly (0,0) satisfies the inequation 3x + 2y ≤ 15. So,the region which contains the origin represents the solution set of the inequation 3x + 2y ≤ 15.
Region represented by x ≥ 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 3x + 3y ≤ 18, 3x + 2y ≤ 15, x ≥ 0 and y ≥ 0 are as follows.
The corner points are O(0, 0), B1(0, 6), E1(3, 3) and C1(5, 0).
The values of Z at these corner points are as follows
| Corner point | Z = 30x + 25y |
| O | 0 |
| B1 | 150 |
| E1 | 165 |
| C1 | 150 |
The maximum value of Z is 165 which is attained at E1(3, 3).
Thus, the maximum profit is Rs 165 obtained when 3 units of each type of trunk is manufactured.
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.
Minimum and maximum z = 5x + 2y subject to the following constraints:
x-2y ≤ 2
3x+2y ≤ 12
-3x+2y ≤ 3
x ≥ 0,y ≥ 0
In order to supplement daily diet, a person wishes to take X and Y tablets. The contents (in milligrams per tablet) of iron, calcium and vitamins in X and Y are given as below :
| Tablets | Iron | Calcium | Vitamin |
| x | 6 | 3 | 2 |
| y | 2 | 3 | 4 |
The person needs to supplement at least 18 milligrams of iron, 21 milligrams of calcium and 16 milligrams of vitamins. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each type should the person take in order to satisfy the above requirement at the minimum cost? Make an LPP and solve graphically.
Maximize Z = 5x + 3y
Subject to
\[3x + 5y \leq 15\]
\[5x + 2y \leq 10\]
\[ x, y \geq 0\]
Minimize Z = 18x + 10y
Subject to
\[4x + y \geq 20\]
\[2x + 3y \geq 30\]
\[ x, y \geq 0\]
Minimize Z = 2x + 4y
Subject to
\[x + y \geq 8\]
\[x + 4y \geq 12\]
\[x \geq 3, y \geq 2\]
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 + 5y
Subject to
\[x + 2y \leq 20\]
\[x + y \leq 15\]
\[ y \leq 5\]
\[ x, y \geq 0\]
Find graphically, the maximum value of Z = 2x + 5y, subject to constraints given below:
2x + 4y ≤ 8
3x + y ≤ 6
x + y ≤ 4
x ≥ 0, y ≥ 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 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.
One kind of cake requires 300 gm of flour and 15 gm of fat, another kind of cake requires 150 gm of flour and 30 gm of fat. Find the maximum number of cakes which can be made from 7.5 kg of flour and 600 gm of fat, assuming that there is no shortage of the other ingradients used in making the cake. Make it as an LPP and solve it graphically.
Two tailors, A and B earn Rs 15 and Rs 20 per day respectively. A can stitch 6 shirts and 4 pants while B can stitch 10 shirts and 4 pants per day. How many days shall each work if it is desired to produce (at least) 60 shirts and 32 pants at a minimum labour cost?
A manufacturer of patent medicines is preparing a production plan on medicines, A and B. There are sufficient raw materials available to make 20000 bottles of A and 40000 bottles of B, but there are only 45000 bottles into which either of the medicines can be put. Further, it takes 3 hours to prepare enough material to fill 1000 bottles of A, it takes 1 hour to prepare enough material to fill 1000 bottles of B and there are 66 hours available for this operation. The profit is Rs 8 per bottle for A and Rs 7 per bottle for B. How should the manufacturer schedule his production in order to maximize his profit?
A cottage industry manufactures pedestal lamps and wooden shades, each requiring the use of grinding/cutting machine and sprayer. It takes 2 hours on the grinding/cutting machine and 3 hours on the sprayer to manufacture a pedestal lamp while it takes 1 hour on the grinding/cutting machine and 2 hours on the sprayer to manufacture a shade. On any day, the sprayer is available for at most 20 hours and the grinding/cutting machine for at most 12 hours. The profit from the sale of a lamp is ₹5.00 and a shade is ₹3.00. Assuming that the manufacturer sell all the lamps and shades that he produces, how should he schedule his daily production in order to maximise his 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 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 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 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.
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?
A medical company has factories at two places, A and B. From these places, supply is made to each of its three agencies situated at P, Q and R. The monthly requirements of the agencies are respectively 40, 40 and 50 packets of the medicines, while the production capacity of the factories, A and B, are 60 and 70 packets respectively. The transportation cost per packet from the factories to the agencies are given below:
| Transportation Cost per packet(in Rs.) | ||
| From-> | A | B |
| To | ||
| P | 5 | 4 |
| Q | 4 | 2 |
| R | 3 | 5 |
The value of objective function is maximum under linear constraints ______.
Find the graphical solution for the system of linear inequation 2x + y ≤ 2, x − y ≤ 1
Find the feasible solution of linear inequation 2x + 3y ≤ 12, 2x + y ≤ 8, x ≥ 0, y ≥ 0 by graphically
The feasible region of an LPP is shown in the figure. If z = 3x + 9y, then the minimum value of z occurs at ______.
Of all the points of the feasible region for maximum or minimum of objective function the points.
A manufacturer wishes to produce two commodities A and B. The number of units of material, labour and equipment needed to produce one unit of each commodity is shown in the table given below. Also shown is the available number of units of each item, material, labour, and equipment.
| Items | Commodity A | Commodity B | Available no. of Units |
| Material | 1 | 2 | 8 |
| Labour | 3 | 2 | 12 |
| Equipment | 1 | 1 | 10 |
Find the maximum profit if each unit of commodity A earns a profit of ₹ 2 and each unit of B earns a profit of ₹ 3.
Which of the statements describe the solution set for `-2(x + 8) = - 2x + 20`?
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 solution set of the inequality 3x + 5y < 4 is ______.
Solve the following Linear Programming Problem graphically:
Maximize Z = 400x + 300y subject to x + y ≤ 200, x ≤ 40, x ≥ 20, y ≥ 0
The shaded part of given figure indicates in feasible region, then the constraints are:
The corner points of the feasible region of a linear programming problem are (0, 4), (8, 0) and `(20/3, 4/3)`. If Z = 30x + 24y is the objective function, then (maximum value of Z – minimum value of Z) is equal to ______.
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.
Minimize z = x + 2y,
Subject to x + 2y ≥ 50, 2x – y ≤ 0, 2x + y ≤ 100, x ≥ 0, y ≥ 0.
