Advertisements
Advertisements
प्रश्न
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
उत्तर
Let the dealer purchase x units of X and y units of Y.
The dealer can sell items X and Y at respective profits of ₹ 300 and ₹ 90
∴ Total profit = Z = 300x + 90y
∴ Given problem can be formulated as follows:
Maximize Z = 300x + 90y
Subject to x + y ≤ 80
2500x + 1000y ≤ 100000, x ≥ 0, y ≥ 0
To draw the feasible region, construct table as follows:
Inequality | x + y ≤ 80 | 2500x + 1000y ≤ 100000 |
Corresponding equation (of line) | x + y = 80 | 2500x + 1000y = 100000 |
Intersection of line with X-axis | (80, 0) | (40, 0) |
Intersection of line with Y-axis | (0, 80) | (0, 100) |
Region | Origin side | Origin side |
Shaded portion OABC is the feasible region, whose vertices are O(0, 0), A(40, 0), B and C(0, 80).
B is the point of intersection of the lines 2500x + 1000y = 100000 and x + y = 80.
Solving the above equations, we get
x = `40/3`, y = `200/3`
∴ B ≡ `(40/3, 200/3)`
Here, the objective function is
Z = 300x + 90y
∴ Z at O(0, 0) = 300(0) + 90(0) = 0
Z at A(40, 0) = 300 (40) + 90(0)
= 12000
Z at B`(40/3, 200/3) = 300(40/3) + 90(200/3)`
= 4000 + 6000
= 10000
Z at C(0, 80) = 300 (0) + 90(80)
= 7200
∴ Z has maximum value 12000 at x = 40 and y = 0.
∴ The dealer should purchase 40 units of X and 0 units of Y to maximize its profit.
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.
Solve the following L.P.P. by graphical method :
Maximize: Z = 3x + 5y subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0 also find maximum value of Z.
Choose the correct alternative:
The value of objective function is maximize under linear constraints.
The region represented by the inequality y ≤ 0 lies in _______ quadrants.
State whether the following is True or False :
The region represented by the inqualities x ≤ 0, y ≤ 0 lies in first quadrant.
Solve the following problem :
Maximize Z = 4x1 + 3x2 Subject to 3x1 + x2 ≤ 15, 3x1 + 4x2 ≤ 24, x1 ≥ 0, x2 ≥ 0
Solve the following problem :
Maximize Z = 60x + 50y Subject to x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 0
Solve the following problem :
A company manufactures bicyles and tricycles, each of which must be processed through two machines A and B Maximum availability of machine A and B is respectively 120 and 180 hours. 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 ₹ 180 for a bicycle and ₹ 220 on a tricycle, determine the number of bicycles and tricycles that should be manufacturing in order to maximize the profit.
Solve the following problem :
A factory produced two types of chemicals A and B The following table gives the units of ingredients P & Q (per kg) of Chemicals A and B as well as minimum requirements of P and Q and also cost per kg. of chemicals A and B.
Ingredients per kg. /Chemical Units | A (x) |
B (y) |
Minimum requirements in |
P | 1 | 2 | 80 |
Q | 3 | 1 | 75 |
Cost (in ₹) | 4 | 6 |
Find the number of units of chemicals A and B should be produced so as to minimize the cost.
Solve the following problem :
A person makes two types of gift items A and B requiring the services of a cutter and a finisher. Gift item A requires 4 hours of cutter's time and 2 hours of finisher's time. B requires 2 hours of cutters time, 4 hours of finishers time. The cutter and finisher have 208 hours and 152 hours available times respectively every month. The profit of one gift item of type A is ₹ 75 and on gift item B is ₹ 125. Assuming that the person can sell all the items produced, determine how many gift items of each type should be make every month to obtain the best returns?
Choose the correct alternative:
The corner points of the feasible region are (4, 2), (5, 0), (4, 1) and (6, 0), then the point of minimum Z = 3.5x + 2y = 16 is at
State whether the following statement is True or False:
If the corner points of the feasible region are (0, 10), (2, 2) and (4, 0), then the minimum value of Z = 3x + 2y is at (4, 0)
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 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
Maximize Z = 400x + 500y subject to constraints
x + 2y ≤ 80, 2x + y ≤ 90, x ≥ 0, y ≥ 0
Amartya wants to invest ₹ 45,000 in Indira Vikas Patra (IVP) and in Public Provident fund (PPF). He wants to invest at least ₹ 10,000 in PPF and at least ₹ 5000 in IVP. If the rate of interest on PPF is 8% per annum and that on IVP is 7% per annum. Formulate the above problem as LPP to determine maximum yearly income.
Solution: Let x be the amount (in ₹) invested in IVP and y be the amount (in ₹) invested in PPF.
x ≥ 0, y ≥ 0
As per the given condition, x + y ______ 45000
He wants to invest at least ₹ 10,000 in PPF.
∴ y ______ 10000
Amartya wants to invest at least ₹ 5000 in IVP.
∴ x ______ 5000
Total interest (Z) = ______
The formulated LPP is
Maximize Z = ______ subject to
______
Solve the following LPP graphically:
Maximize Z = 9x + 13y subject to constraints
2x + 3y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0
Solution: Convert the constraints into equations and find the intercept made by each one of it.
Inequation | Equation | X intercept | Y intercept | Region |
2x + 3y ≤ 18 | 2x + 3y = 18 | (9, 0) | (0, ___) | Towards origin |
2x + y ≤ 10 | 2x + y = 10 | ( ___, 0) | (0, 10) | Towards origin |
x ≥ 0, y ≥ 0 | x = 0, y = 0 | X axis | Y axis | ______ |
The feasible region is OAPC, where O(0, 0), A(0, 6),
P( ___, ___ ), C(5, 0)
The optimal solution is in the following table:
Point | Coordinates | Z = 9x + 13y | Values | Remark |
O | (0, 0) | 9(0) + 13(0) | 0 | |
A | (0, 6) | 9(0) + 13(6) | ______ | |
P | ( ___,___ ) | 9( ___ ) + 13( ___ ) | ______ | ______ |
C | (5, 0) | 9(5) + 13(0) | ______ |
∴ Z is maximum at __( ___, ___ ) with the value ___.
Solve the LPP graphically:
Minimize Z = 4x + 5y
Subject to the constraints 5x + y ≥ 10, x + y ≥ 6, x + 4y ≥ 12, x, y ≥ 0
Solution: Convert the constraints into equations and find the intercept made by each one of it.
Inequations | Equations | X intercept | Y intercept | Region |
5x + y ≥ 10 | 5x + y = 10 | ( ___, 0) | (0, 10) | Away from origin |
x + y ≥ 6 | x + y = 6 | (6, 0) | (0, ___ ) | Away from origin |
x + 4y ≥ 12 | x + 4y = 12 | (12, 0) | (0, 3) | Away from origin |
x, y ≥ 0 | x = 0, y = 0 | x = 0 | y = 0 | 1st quadrant |
∵ Origin has not satisfied the inequations.
∴ Solution of the inequations is away from origin.
The feasible region is unbounded area which is satisfied by all constraints.
In the figure, ABCD represents
The set of the feasible solution where
A(12, 0), B( ___, ___ ), C ( ___, ___ ) and D(0, 10).
The coordinates of B are obtained by solving equations
x + 4y = 12 and x + y = 6
The coordinates of C are obtained by solving equations
5x + y = 10 and x + y = 6
Hence the optimum solution lies at the extreme points.
The optimal solution is in the following table:
Point | Coordinates | Z = 4x + 5y | Values | Remark |
A | (12, 0) | 4(12) + 5(0) | 48 | |
B | ( ___, ___ ) | 4( ___) + 5(___ ) | ______ | ______ |
C | ( ___, ___ ) | 4( ___) + 5(___ ) | ______ | |
D | (0, 10) | 4(0) + 5(10) | 50 |
∴ Z is minimum at ___ ( ___, ___ ) with the value ___