Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
Given that 36x1 + 6x2 ≥ 108
Let 36x1 + 6x2 = 108
6x1 + x2 = 18
| x1 | 0 | 3 | 2 |
| x2 | 18 | 0 | 6 |
Also given that 3x1 + 12x2 ≥ 36
Let 3x1 + 12x2 = 36
x1 + 4x2 = 12
| x1 | 0 | 12 | 4 |
| x2 | 3 | 0 | 2 |
Also given that 20x1 + 10x2 ≥ 100
Let 20x1 + 10x2 = 100
2x1 + x2 = 10
| x1 | 0 | 5 | 4 |
| x2 | 10 | 0 | 2 |
The feasible region satisfying all the conditions is ABCD.
The coordinates of the comer points are A(12, 0), B(4, 2), C(2, 6) and D(0, 18).
| Corner points | Z = 20x1 + 40x2 |
| A(12, 0) | 240 |
| B(4, 2) | 80 + 80 = 160 |
| C(2, 6) | 40 + 240 = 280 |
| D(0, 18) | 720 |
The minimum value of Z occurs at B(4, 2)
∴ The optimal solution is x1 = 4, x2 = 2 and Zmin = 160
APPEARS IN
संबंधित प्रश्न
A furniture dealer deals in tables and chairs. He has ₹ 1,50,000 to invest and a space to store at most 60 pieces. A table costs him ₹ 1500 and a chair ₹ 750. Construct the inequations and find the feasible solution.
Select the appropriate alternatives for each of the following question:
The value of objective function is maximum under linear constraints
Which of the following is correct?
Objective function of LPP is ______.
Solution of LPP to minimize z = 2x + 3y, such that x ≥ 0, y ≥ 0, 1 ≤ x + 2y ≤ 10 is ______.
A printing company prints two types of magazines A and B. The company earns ₹ 10 and ₹ 15 on magazines A and B per copy. These are processed on three machines I, II, III. Magazine A requires 2 hours on Machine I, 5 hours on Machine II and 2 hours on Machine III. Magazine B requires 3 hours on Machine I, 2 hours on Machine II and 6 hours on Machine III. Machines I, II, III are available for 36, 50, 60 hours per week respectively. Formulate the Linear programming problem to maximize the profit.
If the corner points of the feasible region are (0, 0), (3, 0), (2, 1) and `(0, 7/3)` the maximum value of z = 4x + 5y is ______.
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.
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 firm manufactures two products A and B on which the profits earned per unit are ₹ 3 and ₹ 4 respectively. Each product is processed on two machines M1 and M2. Product A requires one minute of processing time on M1 and two minutes on M2, While B requires one minute on M1 and one minute on M2. Machine M1 is available for not more than 7 hrs 30 minutes while M2 is available for 10 hrs during any working day. Formulate this problem as a linear programming problem to maximize the profit.
