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
संबंधित प्रश्न
Find the feasible solution of the following inequation:
3x + 4y ≥ 12, 4x + 7y ≤ 28, y ≥ 1, x ≥ 0.
Solve each of the following inequations graphically using XY-plane:
y ≤ - 3.5
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 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.
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:
| Raw Material\Fertilizers | F1 | F2 | Availability |
| A | 2 | 3 | 40 |
| B | 1 | 4 | 70 |
By selling one unit of F1 and one unit of F2, company gets a profit of ₹ 500 and ₹ 750 respectively. Formulate the problem as L.P.P. to maximize the profit.
Constraints are always in the form of ______ or ______.
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.
The maximum value of Z = 9x + 13y subject to constraints 2x + 3y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0 is ______.
Solve the following LPP by graphical method:
Maximize: z = 3x + 5y Subject to: x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0
Sketch the graph of the following inequation in XOY co-ordinate system.
x + y ≤ 0
