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
संबंधित प्रश्न
Find the feasible solution of the following inequation:
3x + 2y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0
The maximum value of z = 10x + 6y subject to the constraints 3x + y ≤ 12, 2x + 5y ≤ 34, x, ≥ 0, y ≥ 0 is ______.
If the corner points of the feasible solution are (0, 10), (2, 2) and (4, 0), then the point of minimum z = 3x + 2y is ______.
A company manufactures two types of chemicals A and B. Each chemical requires two types of raw material P and Q. The table below shows number of units of P and Q required to manufacture one unit of A and one unit of B.
| Raw Material \Chemical | A | B | Availability |
| p | 3 | 2 | 120 |
| Q | 2 | 5 | 160 |
The company gets profits of ₹ 350 and ₹ 400 by selling one unit of A and one unit of B respectively. Formulate the problem as L.P.P. to maximize the profit.
Choose the correct alternative :
Which of the following is correct?
Which value of x is in the solution set of inequality − 2X + Y ≥ 17
Solve the following linear programming problems by graphical method.
Maximize Z = 40x1 + 50x2 subject to constraints 3x1 + x2 ≤ 9; x1 + 2x2 ≤ 8 and x1, x2 ≥ 0.
The maximum value of Z = 3x + 5y, subject to 3x + 2y ≤ 18, x ≤ a, y ≤ 6, x, y ≥ 0 is ______.
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
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.
