Advertisements
Advertisements
Question
A company produces mixers and food processors. Profit on selling one mixer and one food processor is Rs 2,000 and Rs 3,000 respectively. Both the products are processed through three machines A, B, C. The time required in hours for each product and total time available in hours per week on each machine arc as follows:
| Machine | Mixer | Food Processor | Available time |
| A | 3 | 3 | 36 |
| B | 5 | 2 | 50 |
| C | 2 | 6 | 60 |
How many mixers and food processors should be produced in order to maximize the profit?
Solution
Let x = number of mixers are sold
y = number of food processors are sold
Profit function z = 2000x + 3000y
This is the objective function which is to be maximized. From the given table in the problem, the constraints are
3x + 3y ≤ 36 (above machine A)
5x 2y ≤ 50 ( about machine B)
2x + 6y ≤ 60 ( about machine C)
As the number of mixers and food processors are non-negative.
x ≥ 0, y ≥ 0
Mathematical model of L.P.P. is
Maximize Z = 2000x + 3000y Subject to
3x + 3y ≤ 36, 5x 2y ≤ 50, 2x + 6y ≤ 60
and x ≥ 0, y ≥ 0
First we draw the lines AB, CD and EF whose equations are 3x + 3y = 36, 5x + 2y = 50 and 2x + 6y = 60 respectively.
| Line | Equation | Points on the X-axis | Points on the Y-axis | Sign | Region |
| AB | 3x + 3y = 36 | A(12,0) | B(0,12) | ≤ | origin side of line AB |
| CD | 5x + 2y = 50 | C(10,0) | D(0,25) | ≤ | origin side of line CD |
| EF | 2x + 6y = 60 | E(30,0) | F(0,10) | ≤ | origin side of line EF |
The feasible region is OCPQFO which is shaded in the graph.
The vertices of the feasible region are O (0, 0), C (10, 0), P, Q and F (0, 10).
P is the point of intersection of the lines
3x + 3y = 36 ....(1)
and 5x + 2y = 50 ....(2)
Multiplying equation (1) by 2 and equation (2) by 3, we get,
6x + 6y = 72
15x + 6y = 150
On subtracting, we get
9x = 78
∴ x = `26/3`
∴ from (1), `3(26/3) + 3"y" = 36`
∴ 3y = 10
∴ y = `10/3`
∴ P = `(26/3,10/3)`
Q is the point of intersection of the lines
3x + 3y = 36 . ...(1)
and 2x + 6y = 60 ...(2)
Multiplying equation (1) by 2, we get
6x + 6y = 72
Subtracting equation (3), from this equation, we get
4x = 12
∴ x = 3
∴ from (1), 3(3) + 3y = 36
∴ 3y = 27
∴ y = 9
∴ Q = (3, 9)
The values of the objective function z = 2000x + 3000y at these vertices are
z(O) = 2000(0) + 3000(0) = 0 + 0 = 0
z(C) = 2000(10) + 3000(0) = 20000 + 0 = 20000
z(P) = `2000(26/3) + 3000(10/3) = 52000/3 + 30000/3 = 82000/3`
z(Q) = 2000(3) + 3000(9) = 6000 + 27000 = 33000
z(F) = 2000(0) + 3000(10) = 30000 + 0 = 30000
∴ the maximum value of z is 33000 at the point (3, 9).
Hence, 3 mixers and 9 food processors should be produced in order to get the maximum profit of ₹ 33,000.
APPEARS IN
RELATED QUESTIONS
Find the feasible solution of the following inequation:
2x + 3y ≤ 6, x + y ≥ 2, x ≥ 0, y ≥ 0
Find the feasible solution of the following inequation:
x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.
A company manufactures two types of chemicals Aand B. Each chemical requires two types of raw material P and Q. The table below shows number of units of P and Q required to manufacture one unit of A and one unit of B and the total availability of P and Q.
| Chemical→ | A | B | Availability |
| Raw Material ↓ | |||
| P | 3 | 2 | 120 |
| Q | 2 | 5 | 160 |
The company gets profits of ₹ 350 and ₹ 400 by selling one unit of A and one unit of B respectively. (Assume that the entire production of A and B can be sold). How many units of the chemicals A and B should be manufactured so that the company gets a maximum profit? Formulate the problem as LPP to maximize profit.
A company manufactures two types of fertilizers F1 and F2. Each type of fertilizer requires two raw materials A and B. The number of units of A and B required to manufacture one unit of fertilizer F1 and F2 and availability of the raw materials A and B per day are given in the table below:
| Fertilizers→ | F1 | F2 | Availability |
| Raw Material ↓ | |||
| A | 2 | 3 | 40 |
| B | 1 | 4 | 70 |
By selling one unit of F1 and one unit of F2, the company gets a profit of ₹ 500 and ₹ 750 respectively. Formulate the problem as LPP to maximize the profit.
A doctor has prescribed two different units of foods A and B to form a weekly diet for a sick person. The minimum requirements of fats, carbohydrates and proteins are 18, 28, 14 units respectively. One unit of food A has 4 units of fat, 14 units of carbohydrates and 8 units of protein. One unit of food B has 6 units of fat, 12 units of carbohydrates and 8 units of protein. The price of food A is ₹ 4.5 per unit and that of food B is ₹ 3.5 per unit. Form the LPP, so that the sick person’s diet meets the requirements at a minimum cost.
Solve the following LPP by graphical method:
Maximize z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0
Solve the following LPP by graphical method:
Minimize z = 8x + 10y, subject to 2x + y ≥ 7, 2x + 3y ≥ 15, y ≥ 2, x ≥ 0, y ≥ 0.
Objective function of LPP is ______.
Solution of LPP to minimize z = 2x + 3y, such that x ≥ 0, y ≥ 0, 1 ≤ x + 2y ≤ 10 is ______.
The corner points of the feasible solution given by the inequation x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0 are ______.
If the corner points of the feasible solution are (0, 10), (2, 2) and (4, 0), then the point of minimum z = 3x + 2y is ______.
Solve each of the following inequations graphically using XY-plane:
- 11x - 55 ≤ 0
Solve each of the following inequations graphically using XY-plane:
5y - 12 ≥ 0
Find graphical solution for the following system of linear in equation:
3x + 4y ≤ 12, x - 2y ≥ 2, y ≥ - 1
Solve the following LPP:
Maximize z =60x + 50y subject to
x + 2y ≤ 40, 3x + 2y ≤ 60, x ≥ 0, y ≥ 0.
Solve the following LPP:
Minimize z = 4x + 2y
Subject to 3x + y ≥ 27, x + y ≥ 21, x + 2y ≥ 30, x ≥ 0, y ≥ 0
A manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry and then sent to machine shop for finishing. The number of man hours of labour required in each shop for production of A and B and the number of man hours available for the firm are as follows:
| Gadgets | Foundry | Machine Shop |
| A | 10 | 5 |
| B | 6 | 4 |
| Time available (hours) | 60 | 35 |
Profit on the sale of A is ₹ 30 and B is ₹ 20 per unit. Formulate the L.P.P. to have maximum profit.
Solve the following L.P.P. by graphical method:
Maximize: Z = 4x + 6y
Subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
Choose the correct alternative :
The half plane represented by 3x + 2y ≤ 0 constraints the point.
Choose the correct alternative :
The half plane represented by 4x + 3y ≥ 14 contains the point
Fill in the blank :
The optimal value of the objective function is attained at the _______ points of feasible region.
Fill in the blank :
A dish washing machine holds up to 40 pieces of large crockery (x) This constraint is given by_______.
State whether the following is True or False :
Saina wants to invest at most ₹ 24000 in bonds and fixed deposits. Mathematically this constraints is written as x + y ≤ 24000 where x is investment in bond and y is in fixed deposits.
Minimize z = 7x + y subjected to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0
Maximize z = −x + 2y subjected to constraints x + y ≥ 5, x ≥ 3, x + 2y ≥ 6, y ≥ 0 is this LPP solvable? Justify your answer.
Choose the correct alternative:
The feasible region is
State whether the following statement is True or False:
LPP is related to efficient use of limited resources
Solve the following linear programming problems by graphical method.
Maximize Z = 22x1 + 18x2 subject to constraints 960x1 + 640x2 ≤ 15360; x1 + x2 ≤ 20 and x1, x2 ≥ 0.
Solve the following linear programming problems by graphical method.
Maximize Z = 20x1 + 30x2 subject to constraints 3x1 + 3x2 ≤ 36; 5x1 + 2x2 ≤ 50; 2x1 + 6x2 ≤ 60 and x1, x2 ≥ 0.
Solve the following linear programming problems by graphical method.
Minimize Z = 20x1 + 40x2 subject to the constraints 36x1 + 6x2 ≥ 108; 3x1 + 12x2 ≥ 36; 20x1 + 10x2 ≥ 100 and x1, x2 ≥ 0.
Maximize: z = 3x1 + 4x2 subject to 2x1 + x2 ≤ 40, 2x1 + 5x2 ≤ 180, x1, x2 ≥ 0. In the LPP, which one of the following is feasible comer point?
A solution which maximizes or minimizes the given LPP is called
The maximum value of the objective function Z = 3x + 5y subject to the constraints x ≥ 0, y ≥ 0 and 2x + 5y ≤ 10 is
Solve the following LP.P.
Maximize z = 13x + 9y,
Subject to 3x + 2y ≤ 12,
x + y ≥ 4,
x ≥ 0,
y ≥ 0.
The optimal value of the objective function is attained at the ______ of feasible region.
For the following shaded region, the linear constraint are:
Two kinds of foods A and B are being considered to form a weekly diet. The minimum weekly requirements of fats, Carbohydrates and proteins are 12, 16 and 15 units respectively. One kg of food A has 2, 8 and 5 units respectively of these ingredients and one kg of food B has 6, 2 and 3 units respectively. The price of food A is Rs. 4 per kg and that of food B is Rs. 3 per kg. Formulate the L.P.P. and find the minimum cost.
