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
संबंधित प्रश्न
Find the feasible solution of the following inequation:
x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.
A manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry and then sent to the machine shop for finishing. The number of man-hours of labour required in each shop for production of A and B per unit and the number of man-hours available for the firm is as follows:
| Gadgets | Foundry | Machine shop |
| A | 10 | 5 |
| B | 6 | 4 |
| Time available (hour) | 60 | 35 |
Profit on the sale of A is ₹ 30 and B is ₹ 20 per units. Formulate the L.P.P. to have maximum profit.
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.
Which of the following is correct?
Which value of x is in the solution set of inequality − 2X + Y ≥ 17
Minimize z = 6x + 21y subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0 show that the minimum value of z occurs at more than two points
A company manufactures two models of voltage stabilizers viz., ordinary and auto-cut. All components of the stabilizers are purchased from outside sources, assembly and testing is carried out at the company’s own works. The assembly and testing time required for the two models are 0.8 hours each for ordinary and 1.20 hours each for auto-cut. Manufacturing capacity 720 hours at present is available per week. The market for the two models has been surveyed which suggests a maximum weekly sale of 600 units of ordinary and 400 units of auto-cut. Profit per unit for ordinary and auto-cut models has been estimated at ₹ 100 and ₹ 150 respectively. Formulate the linear programming problem.
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.
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.
The minimum value of z = 5x + 13y subject to constraints 2x + 3y ≤ 18, x + y ≥ 10, x ≥ 0, y ≥ 2 is ______
