Advertisements
Advertisements
प्रश्न
A wholesale dealer deals in two kinds of mixtures A and B of nuts. Each kg of mixture A contains 60 grams of almonds, 30 grams of cashew and 30 grams of hazel nuts. Each kg of mixture B contains 30 grams of almonds, 60 grams of cashew and 180 grams of hazel nuts. A dealer is contemplating to use mixtures A and B to make a bag which will contain at least 240 grams of almonds, 300 grams of cashew and 540 grams of hazel nuts. Mixture A costs ₹ 8 and B costs ₹ 12 per kg. How many kgs of each mixture should he use to minimize the cost of the kgs
उत्तर
Let the dealer use x kg of mixture A and y kg of mixture B.
Since x and y cannot be negative, x ≥ 0, y ≥ 0
Mixture A costs ₹ 8 and Mixture B costs ₹ 12 per kg.
∴ Total cost = Z = 8x + 12y
We construct a table with the constraints of Almond, Cashew and Hazelnut as follows:
| Mixture A | Mixture B | Least value | |
| Almond | 60 | 30 | 240 |
| Cashew | 30 | 60 | 300 |
| Hazelnut | 30 | 180 | 540 |
From the table, the constraints are
60x + 30y ≥ 240
30x + 60y ≥ 300
30x + 180y ≥ 540
∴ Given problem can be formulated as follows:
Minimize Z = 8x + 12y
Subject to 60x + 30y ≥ 240
30x + 60y ≥ 300
30x + 180y ≥ 540, x ≥ 0, y ≥ 0
To draw the feasible region, construct table as follows:
| Inequality | 60x +30y ≥ 240 | 30x+ 60y ≥ 300 | 30x+ 180y ≥ 540 |
| Corresponding equation (of line) | 60x+ 30y = 240 | 30x + 60y = 300 | 30x+ 180y = 540 |
| Intersection of line with X-axis | (4, 0) | (10, 0) | (18, 0) |
| Intersection of line with Y-axis | (0, 8) | (0, 5) | (0, 3) |
| Region | Non-origin side | Non-origin side | Non-origin side |
Shaded portion XABCDY is the feasible region, whose vertices are A(18, 0), B, C and D(0, 8).
B is the point of intersection of the lines 30x + 180y = 540 and 30x + 60y = 300.
Solving the above equations, we get
x = 6, y = 2
∴ B ≡ (6, 2)
C is the point of intersection of the lines 60x + 30y = 240 and 30x + 60y = 300.
Solving the above equations, we get
x = 2, y = 4
∴ C ≡ (2, 4)
Here, the objective function is
Z = 8x + 12y
∴ Z at A(18, 0) = 8(18) + 12(0)
= 144
Z at B(6, 2) = 8(6) + 12(2)
= 48 + 24
= 72
Z at C(2, 4) = 8(2) + 12(4)
= 16 + 48
= 64
Z at D(0, 8) = 8(0) + 12(8)
= 96
∴ Z has minimum value 64 at x = 2 and y = 4.
∴ 2 kgs of mixture A and 4 kgs of mixture B should be used to minimize the cost of the kgs.
APPEARS IN
संबंधित प्रश्न
A small manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry, then sent to the machine shop for finishing. The number of man-hours of labour required in each shop for the production of each unit of A and B, and the number of man-hours the firm has available per week are as follows:
| Gadget | Foundry | Machine-shop |
| A | 10 | 5 |
| B | 6 | 4 |
| Firm's capacity per week | 1000 | 600 |
The profit on the sale of A is Rs 30 per unit as compared with Rs 20 per unit of B. The problem is to determine the weekly production of gadgets A and B, so that the total profit is maximized. Formulate this problem as a LPP.
Amit's mathematics teacher has given him three very long lists of problems with the instruction to submit not more than 100 of them (correctly solved) for credit. The problem in the first set are worth 5 points each, those in the second set are worth 4 points each, and those in the third set are worth 6 points each. Amit knows from experience that he requires on the average 3 minutes to solve a 5 point problem, 2 minutes to solve a 4 point problem, and 4 minutes to solve a 6 point problem. Because he has other subjects to worry about, he can not afford to devote more than
A firm manufactures two products, each of which must be processed through two departments, 1 and 2. The hourly requirements per unit for each product in each department, the weekly capacities in each department, selling price per unit, labour cost per unit, and raw material cost per unit are summarized as follows:
| Product A | Product B | Weekly capacity | |
| Department 1 | 3 | 2 | 130 |
| Department 2 | 4 | 6 | 260 |
| Selling price per unit | ₹ 25 | ₹ 30 | |
| Labour cost per unit | ₹ 16 | ₹ 20 | |
| Raw material cost per unit | ₹ 4 | ₹ 4 |
The problem is to determine the number of units to produce each product so as to maximize total contribution to profit. Formulate this as a LPP.
Solve the following L.P.P. by graphical method :
Maximize : Z = 7x + 11y subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0.
Solve the following L.P.P. by graphical method :
Minimize : Z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.
The region represented by the inequalities x ≥ 0, y ≥ 0 lies in first quadrant.
Solve the following problem :
Maximize Z = 5x1 + 6x2 Subject to 2x1 + 3x2 ≤ 18, 2x1 + x2 ≤ 12, x ≥ 0, x2 ≥ 0
A carpenter makes chairs and tables, profits are ₹ 140 per chair and ₹ 210 per table. Both products are processed on three machines, Assembling, Finishing and Polishing. The time required for each product in hours and the availability of each machine is given by the following table.
| Product/Machines | Chair (x) |
Table (y) |
Available time (hours) |
| Assembling | 3 | 3 | 36 |
| Finishing | 5 | 2 | 50 |
| Polishing | 2 | 6 | 60 |
Formulate and solve the following Linear programming problems using graphical method.
Choose the correct alternative:
If LPP has optimal solution at two point, then
Choose the correct alternative:
The corner points of feasible region for the inequations, x + y ≤ 5, x + 2y ≤ 6, x ≥ 0, y ≥ 0 are
State whether the following statement is True or False:
The maximum value of Z = 5x + 3y subjected to constraints 3x + y ≤ 12, 2x + 3y ≤ 18, 0 ≤ x, y is 20
State whether the following statement is True or False:
A convex set includes the points but not the segment joining the points
State whether the following statement is True or False:
Corner point method is most suitable method for solving the LPP graphically
A set of values of variables satisfying all the constraints of LPP is known as ______
A company manufactures 2 types of goods P and Q that requires copper and brass. Each unit of type P requires 2 grams of brass and 1 gram of copper while one unit of type Q requires 1 gram of brass and 2 grams of copper. The company has only 90 grams of brass and 80 grams of copper. Each unit of types P and Q brings profit of ₹ 400 and ₹ 500 respectively. Find the number of units of each type the company should produce to maximize its profit
A dealer deals in two products X and Y. He has ₹ 1,00,000/- to invest and space to store 80 pieces. Product X costs ₹ 2500/- and product Y costs ₹ 1000/- per unit. He can sell the items X and Y at respective profits of ₹ 300 and ₹ 90. Construct the LPP and find the number of units of each product to be purchased to maximize its profit
A company manufactures two types of ladies dresses C and D. The raw material and labour available per day is given in the table.
| Resources | Dress C(x) | Dress D(y) | Max. availability |
| Raw material | 5 | 4 | 60 |
| Labour | 5 | 3 | 50 |
P is the profit, if P = 50x + 100y, solve this LPP to find x and y to get the maximum profit
Maximize Z = 400x + 500y subject to constraints
x + 2y ≤ 80, 2x + y ≤ 90, x ≥ 0, y ≥ 0
Minimize Z = x + 4y subject to constraints
x + 3y ≥ 3, 2x + y ≥ 2, x ≥ 0, y ≥ 0
