Advertisements
Advertisements
प्रश्न
Solve the following linear programming problem graphically.
Maximize Z = 60x1 + 15x2 subject to the constraints: x1 + x2 ≤ 50; 3x1 + x2 ≤ 90 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 = 50
| x1 | 0 | 50 |
| x2 | 50 | 0 |
3x1 + x2 = 90
| x1 | 0 | 30 |
| x2 | 90 | 0 |
The feasible region is OABC and its co-ordinates are O(0, 0) A(30, 0) C(0, 50) and B is the point of intersection of the lines
x1 + x2 = 50 ..........(1)
3x1 + x2 = 90 .........(2)
Verification of B:
x1 + x2 = 50 ..........(1)
3x1 + x2 = 90 .........(2)
− − −
− 2x1 = − 40
x1 = 20
From (1), 20 + x2 = 50
x2 = 30
∴ B is (20, 30)
| Corner points | Z = 60x1 + 15x2 |
| O(0, 0) | 0 |
| A(30, 0) | 1800 |
| B(20, 30) | 1650 |
| C(0, 50) | 7500 |
Maximum value occurs at C(0, 50)
∴ The solution is x1 = 0, x2 = 50 and Zmax = 7500.
APPEARS IN
संबंधित प्रश्न
The maximum value of z = 10x + 6y subject to the constraints 3x + y ≤ 12, 2x + 5y ≤ 34, x, ≥ 0, y ≥ 0 is ______.
Sketch the graph of the following inequation in XOY co-ordinate system:
|x + 5| ≤ y
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 printing company prints two types of magazines A and B. The company earns ₹ 10 and ₹ 15 on 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, 60 hours per week respectively. Formulate the Linear programming problem to maximize the profit.
Choose the correct alternative :
The corner points of the feasible region given by the inequations x + y ≤ 4, 2x + y ≤ 7, x ≥ 0, y ≥ 0, are
Fill in the blank :
A dish washing machine holds up to 40 pieces of large crockery (x) This constraint is given by_______.
Choose the correct alternative:
The feasible region is
Constraints are always in the form of ______ or ______.
A company produces two types of pens A and B. Pen A is of superior quality and pen B is of lower quality. Profits on pens A and B are ₹ 5 and ₹ 3 per pen respectively. Raw materials required for each pen A is twice as that of pen B. The supply of raw material is sufficient only for 1000 pens per day. Pen A requires a special clip and only 400 such clips are available per day. For pen B, only 700 clips are available per day. Formulate this problem as a linear programming problem.
Solve the following linear programming problems by graphical method.
Maximize Z = 22x1 + 18x2 subject to constraints 960x1 + 640x2 ≤ 15360; x1 + x2 ≤ 20 and x1, x2 ≥ 0.
