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.
उत्तर
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
संबंधित प्रश्न
Which of the following statements is correct?
Find the feasible solution of the following inequation:
3x + 2y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0
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.
The corner points of the feasible solution are (0, 0), (2, 0), `(12/7, 3/7)`, (0, 1). Then z = 7x + y is maximum at ______.
Fill in the blank :
A dish washing machine holds up to 40 pieces of large crockery (x) This constraint is given by_______.
Maximize z = 5x + 2y subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 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.
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 set of feasible solutions of LPP is a ______.
