Advertisements
Advertisements
प्रश्न
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.
उत्तर
Since the decision variables, x1 and x2 are non-negative, the solution lies in the I quadrant of the plane.
Consider the equations
x1 + 2x2 = 10
| x1 | 0 | 10 |
| x2 | 5 | 0 |
3x1 + 4x2 = 24
| x1 | 0 | 8 |
| x2 | 6 | 0 |
The feasible region is ABC and its co-ordinates are A(0, 5) C(0, 6) and B is the point of intersection of the lines
x1 + 2x2 = 10 ..........(1)
3x1 + 4x2 = 24 .........(2)
Verification of B:
3x1 + 6x2 = 30 ..........[(1) × 3]
3x1 + 4x2 = 24 .........(2)
− − −
2x2 = 6
x2 = 3
From (1), x1 + 6 = 10
x1 = 4
∴ B is (4, 3)
| Corner points | Z = 200x1 + 500x2 |
| A(0, 5) | 2500 |
| B(4, 3) | 2300 |
| C(0, 6) | 3000 |
Minimum value occurs at B(4, 3)
∴ The solution is x1 = 4, x2 = 3 and Zmin = 2300.
APPEARS IN
संबंधित प्रश्न
Find the feasible solution of the following inequation:
x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.
A company manufactures two types of fertilizers F1 and F2. Each type of fertilizer requires two raw materials A and B. The number of units of A and B required to manufacture one unit of fertilizer F1 and F2 and availability of the raw materials A and B per day are given in the table below:
| Fertilizers→ | F1 | F2 | Availability |
| Raw Material ↓ | |||
| A | 2 | 3 | 40 |
| B | 1 | 4 | 70 |
By selling one unit of F1 and one unit of F2, the company gets a profit of ₹ 500 and ₹ 750 respectively. Formulate the problem as LPP to maximize the profit.
Minimize z = 6x + 2y, subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, 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 ______.
Of all the points of the feasible region, the optimal value of z obtained at the point lies ______.
Solve the following L.P.P. by graphical method:
Maximize: Z = 4x + 6y
Subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
If the corner points of the feasible region are (0, 0), (3, 0), (2, 1) and `(0, 7/3)` the maximum value of z = 4x + 5y is ______.
Fill in the blank :
The optimal value of the objective function is attained at the _______ points of feasible region.
The constraint that in a particular XII class, number of boys (y) are less than number of girls (x) is given by ______
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.
