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.
Advertisements
उत्तर
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
संबंधित प्रश्न
A company produces two types of articles A and B which requires silver and gold. Each unit of A requires 3 gm of silver and 1 gm of gold, while each unit of B requires 2 gm of silver and 2 gm of gold. The company has 6 gm of silver and 4 gm of gold. Construct the inequations and find feasible solution graphically.
A printing company prints two types of magazines A and B. The company earns ₹ 10 and ₹ 15 in magazines A and B per copy. These are processed on three Machines I, II, III. Magazine A requires 2 hours on Machine I, 5 hours on Machine II, and 2 hours on machine III. Magazine B requires 3 hours on machine I, 2 hours on machine II and 6 hours on Machine III. Machines I, II, III are available for 36, 50, and 60 hours per week respectively. Formulate the LPP to determine weekly production of magazines A and B, so that the total profit is maximum.
Select the appropriate alternatives for each of the following question:
The value of objective function is maximum under linear constraints
Of all the points of the feasible region, the optimal value of z obtained at the point lies ______.
Solve the following LPP:
Maximize z = 2x + 3y subject to x - y ≥ 3, x ≥ 0, y ≥ 0.
Solve each of the following inequations graphically using XY-plane:
4x - 18 ≥ 0
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 firm manufacturing two types of electrical items A and B, can make a profit of ₹ 20 per unit of A and ₹ 30 per unit of B. Both A and B make use of two essential components a motor and a transformer. Each unit of A requires 3 motors and 2 transformers and each units of B requires 2 motors and 4 transformers. The total supply of components per month is restricted to 210 motors and 300 transformers. How many units of A and B should be manufactured per month to maximize profit? How much is the maximum profit?
A firm manufactures two products A and B on which the profits earned per unit are ₹ 3 and ₹ 4 respectively. Each product is processed on two machines M1 and M2. Product A requires one minute of processing time on M1 and two minutes on M2, While B requires one minute on M1 and one minute on M2. Machine M1 is available for not more than 7 hrs 30 minutes while M2 is available for 10 hrs during any working day. Formulate this problem as a linear programming problem to maximize the profit.
