Advertisements
Advertisements
Question
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.
Advertisements
Solution
Given that 3x1 + 3x2 ≤ 36
Let 3x1 + 3x2 = 36
| x1 | 0 | 12 |
| x2 | 12 | 0 |
Also given that 5x1 + 2x2 ≤ 50
Let 5x1 + 2x2 = 50
| x1 | 0 | 10 |
| x2 | 25 | 0 |
3x1 + 3x2 = 36
x1 + x2 = 12 ……….(1)
5x1 + 2x2 = 50 ………(2)
2x1 + 2x2 = 24 ....[(1) × 2]
− − −
−3x1 = − 6
x1 = 2
Substituting x1 = 2 in (1) we get
2+ x2 = 12
x2 = 6
Also given that 2x1 + 6x2 ≤ 60
Let 2x1 + 6x2 = 60
x1 + 3x2 = 30
| x1 | 0 | 30 |
| x2 | 10 | 0 |
x1 + x2 = 12 …….(1)
x1 + 3x2 = 30 …….(2)
– 2x2 = – 18 ......[Equation (1) – (2)]
x2 = 9
x2 = 9 substitute in (1)
x1 + x2 = 12
x1 + 9 = 12
x1 = 12 – 9
x1 = 3
The feasible region satisfying all the given conditions is OABCD.
The co-ordinates of the comer points are
| Corner points | Z = 20x1 + 30x2 |
| O(0, 0) | 0 |
| A(10, 0) | 200 |
| B(2, 6) | 220 |
| C(3, 9) | 330 |
| D(0, 10) | 300 |
The maximum value of Z occurs at C(3, 9)
∴ The optimal solution is x1 = 3, x2 = 9 and Zmax = 330
APPEARS IN
RELATED QUESTIONS
Find the feasible solution of the following inequation:
3x + 2y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0
Solve the following LPP by graphical method:
Maximize z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0
Objective function of LPP is ______.
The point of which the maximum value of x + y subject to the constraints x + 2y ≤ 70, 2x + y ≤ 95, x, ≥ 0, y ≥ 0 is is obtained at ______.
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.
Objective function of LPP is ______.
The point of which the maximum value of z = x + y subject to constraints x + 2y ≤ 70, 2x + y ≤ 90, x ≥ 0, y ≥ 0 is obtained at
Minimize z = 6x + 21y subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0 show that the minimum value of z occurs at more than two points
Solve the following linear programming problems by graphical method.
Maximize Z = 6x1 + 8x2 subject to constraints 30x1 + 20x2 ≤ 300; 5x1 + 10x2 ≤ 110; and x1, x2 ≥ 0.
Solve the following LPP by graphical method:
Maximize: z = 3x + 5y Subject to: x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0
