Advertisements
Advertisements
प्रश्न
Solve the following linear programming problem graphically.
Maximize Z = 3x1 + 5x2 subject to the constraints: x1 + x2 ≤ 6, x1 ≤ 4; x2 ≤ 5, and x1, 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 + x2 = 6
| x1 | 0 | 6 |
| x2 | 6 | 0 |
x1 = 4 is a line parallel to x2-axis at a distance of 4 units.
x2 = 5 is a line parallel to x1-axis at a distance of 5 units.
The feasible region is OABCD and its co-ordinates are O(0, 0) A(4, 0) D(5, 0) and B is the point of intersection of the lines x1 + x2 = 6 and x1 = 4
Also C is the point of intersection of the lines x1 + x2 = 6 and x2 = 5
Verification of B:
x1 + x2 = 6 and x1 = 4
4 + x2 = 6
x2 = 2
∴ B is (4, 2)
Verification of C:
x1 + x2 = 6 and x2 = 5
x1 + 5 = 6
x1 = 1
∴ C is (1, 5)
| Corner points | Z = 3x1 + 5x2 |
| O(0, 0) | 0 |
| A(4, 0) | 12 |
| B(4, 2) | 22 |
| C(1, 5) | 26 |
| D(5, 0) | 15 |
Maximum of Z occurs at C(1, 5)
∴ The solution is x1 = 1, x2 = 5 and Zmax = 26.
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.
Select the appropriate alternatives for each of the following question:
The value of objective function is maximum under linear constraints
Sketch the graph of the following inequation in XOY co-ordinate system:
|x + 5| ≤ y
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 ______.
Maximize z = 10x + 25y subject to x + y ≤ 5, 0 ≤ x ≤ 3, 0 ≤ y ≤ 3
Constraints are always in the form of ______ or ______.
Solve the following linear programming problems by graphical method.
Minimize Z = 3x1 + 2x2 subject to the constraints 5x1 + x2 ≥ 10; x1 + x2 ≥ 6; x1 + 4x2 ≥ 12 and x1, x2 ≥ 0.
Solve the following linear programming problem graphically.
Maximise Z = 4x1 + x2 subject to the constraints x1 + x2 ≤ 50; 3x1 + x2 ≤ 90 and x1 ≥ 0, x2 ≥ 0.
Solve the following LP.P.
Maximize z = 13x + 9y,
Subject to 3x + 2y ≤ 12,
x + y ≥ 4,
x ≥ 0,
y ≥ 0.
The set of feasible solutions of LPP is a ______.
