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.
The company makes concrete bricks made up of cement and sand. The weight of a concrete brick has to be at least 5 kg. Cement costs ₹ 20 per kg and sand costs of ₹ 6 per kg. Strength consideration dictates that a concrete brick should contain minimum 4 kg of cement and not more than 2 kg of sand. Form the L.P.P. for the cost to be minimum.
Objective function of LPP is ______.
Solution of LPP to minimize z = 2x + 3y, such that x ≥ 0, y ≥ 0, 1 ≤ x + 2y ≤ 10 is ______.
A manufacturer produces bulbs and tubes. Each of these must be processed through two machines M1 and M2. A package of bulbs requires 1 hour of work on Machine M1 and 3 hours of work on M2. A package of tubes requires 2 hours on Machine M1 and 4 hours on Machine M2. He earns a profit of ₹ 13.5 per package of bulbs and ₹ 55 per package of tubes. If maximum availability of Machine M1 is 10 hours and that of Machine M2 is 12 hours, then formulate the L.P.P. to maximize the profit.
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 ______.
Choose the correct alternative :
The half plane represented by 3x + 2y ≤ 0 constraints the point.
Constraints are always in the form of ______ or ______.
Solve the following LP.P.
Maximize z = 13x + 9y,
Subject to 3x + 2y ≤ 12,
x + y ≥ 4,
x ≥ 0,
y ≥ 0.
Sketch the graph of the following inequation in XOY co-ordinate system.
x + y ≤ 0
