Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
Let x number of bicycles and y number of tricycles be manufactured by the company.
∴ Total profit Z = 180x + 220y
This is the objective function to be maximized.
The given information can be tabulated as shown below:
| Bicycles (x) |
Tricycles (y) |
Maximum availability of time (hrs) | |
| Machine A | 6 | 4 | 120 |
| Machine B | 3 | 10 | 180 |
∴ The constraints are 6x + 4y ≤ 120, 3x + 10y ≤ 180, x ≥ 0, y ≥ 0
∴ Given problem can be formulated as
Maximize Z = 180x + 220y
Subject to, 6x + 4y ≤ 120, 3x + 10y ≤ 180 , x ≥ 0, y ≥ 0.
To draw the feasible region, construct the table as follows:
| Inequality | 6x + 4y ≤ 120 | 3x + 10y ≤ 180 |
| Corresponding equation (of line) | 6x + 4y = 120 | 3x + 10y = 180 |
| Intersection of line with X-axis | (20, 0) | (60, 0) |
| Intersection of line with Y-axis | (0, 30) | (0, 18) |
| Region | Origin side | Origin side |
Shaded portion OABC is the feasible region,
whose vertices are O ≡ (0, 0), A ≡ (20, 0), B and C ≡ (0, 18)
B is the point of intersection of the lines 3x + 10y = 180 and 6x + 4y = 120.
Solving the above equations, we get
B ≡ (10, 15)
Here the objective function is,
Z = 180x + 220y
∴ Z at O(0, 0) = 180(0) + 220(0) = 0
Z at A(20, 0) = 180(20) + 220(0) = 3600
Z at B(10, 15) = 180(10) + 220(15) = 5100
Z at C(0, 18) = 180(0) + 220(18) = 3960
∴ Z has maximum value 5100 at B(10, 15)
∴ Z is maximum when x = 10, y = 15
Thus, the company should manufacture 10 bicycles and 15 tricycles to gain maximum profit of ₹ 5100.
APPEARS IN
संबंधित प्रश्न
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
The corner points 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 Z = px + qy, where p, q > 0. Condition on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is
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 :
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 maximum value of z = 5x + 3y. subject to the constraints
Choose the correct alternative :
The maximum value of z = 10x + 6y, subjected to the constraints 3x + y ≤ 12, 2x + 5y ≤ 34, x ≥ 0, y ≥ 0 is.
The region represented by the inequality y ≤ 0 lies in _______ quadrants.
The constraint that a factory has to employ more women (y) than men (x) is given by _______
The region represented by the inequalities x ≥ 0, y ≥ 0 lies in first quadrant.
State whether the following is True or False :
The region represented by the inqualities x ≤ 0, y ≤ 0 lies in first quadrant.
Graphical solution set of x ≤ 0, y ≥ 0 in xy system lies in second quadrant.
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.
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.
State whether the following statement is True or False:
If LPP has two optimal solutions, then the LPP has infinitely many solutions
State whether the following statement is True or False:
If the corner points of the feasible region are `(0, 7/3)`, (2, 1), (3, 0) and (0, 0), then the maximum value of Z = 4x + 5y is 12
State whether the following statement is True or False:
Of all the points of feasible region, the optimal value is obtained at the boundary of the feasible region
If the feasible region is bounded by the inequations 2x + 3y ≤ 12, 2x + y ≤ 8, 0 ≤ x, 0 ≤ y, then point (5, 4) is a ______ of the feasible region
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 = 5x + 10y subject to constraints
x + 2y ≤ 10, 3x + y ≤ 12, 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 ___.
Graphical solution set of the inequations x ≥ 0 and y ≤ 0 lies in ______ quadrant.
