Advertisements
Advertisements
प्रश्न
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.
Advertisements
उत्तर
Given that 36x1 + 6x2 ≥ 108
Let 36x1 + 6x2 = 108
6x1 + x2 = 18
| x1 | 0 | 3 | 2 |
| x2 | 18 | 0 | 6 |
Also given that 3x1 + 12x2 ≥ 36
Let 3x1 + 12x2 = 36
x1 + 4x2 = 12
| x1 | 0 | 12 | 4 |
| x2 | 3 | 0 | 2 |
Also given that 20x1 + 10x2 ≥ 100
Let 20x1 + 10x2 = 100
2x1 + x2 = 10
| x1 | 0 | 5 | 4 |
| x2 | 10 | 0 | 2 |
The feasible region satisfying all the conditions is ABCD.
The coordinates of the comer points are A(12, 0), B(4, 2), C(2, 6) and D(0, 18).
| Corner points | Z = 20x1 + 40x2 |
| A(12, 0) | 240 |
| B(4, 2) | 80 + 80 = 160 |
| C(2, 6) | 40 + 240 = 280 |
| D(0, 18) | 720 |
The minimum value of Z occurs at B(4, 2)
∴ The optimal solution is x1 = 4, x2 = 2 and Zmin = 160
APPEARS IN
संबंधित प्रश्न
Solve the following LPP by graphical method:
Maximize z = 11x + 8y, subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x ≥ 0, y ≥ 0
Minimize z = 6x + 21y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0.
Objective function of LPP is ______.
Of all the points of the feasible region, the optimal value of z obtained at the point lies ______.
The feasible region is the set of point which satisfy.
A company produces two types of pens A and B. Pen A is of superior quality and pen B is of lower quality. Profits on pens A and B are ₹ 5 and ₹ 3 per pen respectively. Raw materials required for each pen A is twice as that of pen B. The supply of raw material is sufficient only for 1000 pens per day. Pen A requires a special clip and only 400 such clips are available per day. For pen B, only 700 clips are available per day. Formulate this problem as a linear programming problem.
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.
A solution which maximizes or minimizes the given LPP is called
Solve the following linear programming problem graphically.
Minimize Z = 200x1 + 500x2 subject to the constraints: x1 + 2x2 ≥ 10; 3x1 + 4x2 ≤ 24 and x1 ≥ 0, x2 ≥ 0.
Which of the following can be considered as the objective function of a linear programming problem?
