Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
Given that 30x1 + 20x2 ≤ 300
Let 30x1 + 20x2 = 300
Therefore 3x1 + 2x2 = 30
| x1 | 0 | 10 |
| x2 | 15 | 0 |
Also given that 5x1 + 10x2 ≤ 110
Let 5x1 + 10x2 = 110
x1 + 2x2 = 22
| x1 | 0 | 22 |
| x2 | 11 | 0 |
To get point of intersection, (i.e., the to get co-ordinates of B)
3x1 + 2x2 = 30 …….(1)
x1 + 2x2 = 22 ……..(2)
2x1 = 8 ......[Equation (1) – (2)]
x1 = 4
x1 = 4 substitute in (1),
x1 + 2x2 = 22
4 + 2x2 = 22
2x2 = 18
x2 = 9
i.e., B is (4, 9)
The feasible region satisfying all the given conditions is OABC.
The co-ordinates of the points are O(0, 0), A(10, 0), B(4, 9), C(0, 11).
| Corner points | Z = 6x1 + 8x2 |
| O(0, 0) | 0 |
| A(10, 0) | 60 |
| B(4, 9) | 6 × 4 + 8 × 9 = 96 |
| C(0, 11) | 88 |
The maximum value of Z occurs at B(4, 9).
∴ The optimal solution is x1 = 4, x2 = 9 and Zmax = 96
APPEARS IN
संबंधित प्रश्न
The company makes concrete bricks made up of cement and sand. The weight of a concrete brick has to be at least 5 kg. Cement costs ₹ 20 per kg and sand costs of ₹ 6 per kg. Strength consideration dictates that a concrete brick should contain minimum 4 kg of cement and not more than 2 kg of sand. Form the L.P.P. for the cost to be minimum.
Solve the following LPP by graphical method:
Maximize z = 4x + 6y, subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
The corner points of the feasible solution given by the inequation x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0 are ______.
Solve the following LPP:
Maximize z = 4x + 2y subject to 3x + y ≤ 27, x + y ≤ 21, x ≥ 0, y ≥ 0.
Solve each of the following inequations graphically using XY-plane:
- 11x - 55 ≤ 0
Choose the correct alternative :
Of all the points of the feasible region the optimal value of z is obtained at a point
Choose the correct alternative :
The corner points of the feasible region given by the inequations x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0, are
Maximize z = 10x + 25y subject to x + y ≤ 5, 0 ≤ x ≤ 3, 0 ≤ y ≤ 3
Minimize z = 7x + y subjected to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.
Find graphical solution for the following system of linear in equation:
x + 2y ≥ 4, 2x - y ≤ 6
