Advertisements
Advertisements
प्रश्न
Solve the following linear programming problems by graphical method.
Maximize Z = 40x1 + 50x2 subject to constraints 3x1 + x2 ≤ 9; x1 + 2x2 ≤ 8 and x1, x2 ≥ 0.
Advertisements
उत्तर
Given that 3x1 + x2 ≤ 9
Let 3x1 + x2 = 9
| x1 | 0 | 3 |
| x2 | 9 | 0 |
Also given that x1 + 2x2 ≤ 8]
Let x1 + 2x2 = 8
| x1 | 0 | 8 |
| x2 | 4 | 0 |
3x1 + x2 = 9 ………(1)
x1 + 2x2 = 8 ……..(2)
6x1 + 2x2 = 18 ……..(3) [Multiply by 2 for eq. (1)]
− 5x1 = − 10
x1 = 2
x1 = 2 substitute in (1)
3(2) + x2 = 9
x2 = 3
The feasible region satisfying all the conditions is OABC.
The co-ordinates of the corner points are O(0, 0), A(3, 0), B(2, 3), C(0, 4)
| Corner points | Z = 40x1 + 50x2 |
| O(0, 0) | 0 |
| A(3, 0) | 120 |
| B(2, 3) | 40 × 2 + 50 × 3 = 80 + 150 = 230 |
| C(0, 4) | 200 |
The maximum value of Z occurs at B(2, 3).
∴ The optimal solution is x1 = 2, x2 = 3 and Zmax = 230
APPEARS IN
संबंधित प्रश्न
A manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry and then sent to the machine shop for finishing. The number of man-hours of labour required in each shop for production of A and B per unit and the number of man-hours available for the firm is as follows:
| Gadgets | Foundry | Machine shop |
| A | 10 | 5 |
| B | 6 | 4 |
| Time available (hour) | 60 | 35 |
Profit on the sale of A is ₹ 30 and B is ₹ 20 per units. Formulate the L.P.P. to have maximum profit.
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.
The corner points of the feasible solution given by the inequation x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0 are ______.
A manufacturer produces bulbs and tubes. Each of these must be processed through two machines M1 and M2. A package of bulbs requires 1 hour of work on Machine M1 and 3 hours of work on M2. A package of tubes requires 2 hours on Machine M1 and 4 hours on Machine M2. He earns a profit of ₹ 13.5 per package of bulbs and ₹ 55 per package of tubes. If maximum availability of Machine M1 is 10 hours and that of Machine M2 is 12 hours, then formulate the L.P.P. to maximize the profit.
Choose the correct alternative :
The half plane represented by 4x + 3y ≥ 14 contains the point
Which value of x is in the solution set of inequality − 2X + Y ≥ 17
Choose the correct alternative:
Z = 9x + 13y subjected to constraints 2x + 3y ≤ 18, 2x + y ≤ 10, 0 ≤ x, y was found to be maximum at the point
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.
Minimize Z = 20x1 + 40x2 subject to the constraints 36x1 + 6x2 ≥ 108; 3x1 + 12x2 ≥ 36; 20x1 + 10x2 ≥ 100 and x1, x2 ≥ 0.
The optimal value of the objective function is attained at the ______ of feasible region.
