Advertisements
Advertisements
प्रश्न
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.
उत्तर
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
संबंधित प्रश्न
The maximum value of z = 10x + 6y subject to the constraints 3x + y ≤ 12, 2x + 5y ≤ 34, x, ≥ 0, y ≥ 0 is ______.
The corner points of the feasible solution given by the inequation x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0 are ______.
Solve each of the following inequations graphically using XY-plane:
5y - 12 ≥ 0
Find graphical solution for the following system of linear in equation:
3x + 4y ≤ 12, x - 2y ≥ 2, y ≥ - 1
A company produces mixers and food processors. Profit on selling one mixer and one food processor is Rs 2,000 and Rs 3,000 respectively. Both the products are processed through three machines A, B, C. The time required in hours for each product and total time available in hours per week on each machine arc as follows:
| Machine | Mixer | Food Processor | Available time |
| A | 3 | 3 | 36 |
| B | 5 | 2 | 50 |
| C | 2 | 6 | 60 |
How many mixers and food processors should be produced in order to maximize the profit?
State whether the following is True or False :
The feasible solution of LPP belongs to only quadrant I.
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.
A solution which maximizes or minimizes the given LPP is called
The set of feasible solutions of LPP is a ______.
Food F1 contains 2, 6, 1 units and food F2 contains 1, 1, 3 units of proteins, carbohydrates, fats respectively per kg. 8, 12 and 9 units of proteins, carbohydrates and fats is the weekly minimum requirement for a person. The cost of food F1 is Rs. 85 and food F2 is Rs. 40 per kg. Formulate the L.P.P. to minimize the cost.
