Advertisements
Advertisements
Question
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.
Advertisements
Solution
(i) Variables: Let x1 represents the product A and x2 represents the product B.
(ii) Objective function:
Profit earned from Product A = 3x1
Profit earned from Product B = 4x2
Let Z = 3x1 + 4x2
Since the profit is to be maximized, we have maximize Z = 3x1 + 4x2
(iii) Constraints:
| M1 | M2 | |
| Requirement for A | 1 min | 2 min |
| Requirement for B | 1 min | 1 min |
M1 is available for 7 hrs 30 min = 7 × 60 + 30 = 450 min
M2 is available for 10 hrs = 10 × 60 = 600 min
∴ x1 + x2 ≤ 450 .....[for M1]
2x1 + x2 ≤ 600 ......[for M2]
(iv) Non-negative restrictions:
Since the number of products of type A and B cannot be negative, x1, x2 ≥ 0.
Hence, the mathematical formulation of the LLP is maximize
Z = 3x1 + 4x2
Subject to the constraints
x1 + x2 ≤ 450
2x1 + x2 ≤ 600
x1, x2 ≥ 0
APPEARS IN
RELATED QUESTIONS
A furniture dealer deals in tables and chairs. He has ₹ 1,50,000 to invest and a space to store at most 60 pieces. A table costs him ₹ 1500 and a chair ₹ 750. Construct the inequations and find the feasible solution.
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 Machine 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. Formulate the LPP to maximize the profit, if he operates the machine M1, for almost 10 hours a day and machine M2 for almost 12 hours a day.
Select the appropriate alternatives for each of the following question:
The value of objective function is maximum under linear constraints
The point of which the maximum value of x + y subject to the constraints x + 2y ≤ 70, 2x + y ≤ 95, x, ≥ 0, y ≥ 0 is is obtained at ______.
Of all the points of the feasible region, the optimal value of z obtained at the point lies ______.
A carpenter makes chairs and tables. Profits are ₹ 140 per chair and ₹ 210 per table. Both products are processed on three machines: Assembling, Finishing and Polishing. The time required for each product in hours and availability of each machine is given by the following table:
| Product → | Chair (x) | Table (y) | Available time (hours) |
| Machine ↓ | |||
| Assembling | 3 | 3 | 36 |
| Finishing | 5 | 2 | 50 |
| Polishing | 2 | 6 | 60 |
Formulate the above problem as LPP. Solve it graphically
Choose the correct alternative :
Of all the points of the feasible region the optimal value of z is obtained at a point
Maximize z = −x + 2y subjected to constraints x + y ≥ 5, x ≥ 3, x + 2y ≥ 6, y ≥ 0 is this LPP solvable? Justify your answer.
Given an L.P.P maximize Z = 2x1 + 3x2 subject to the constrains x1 + x2 ≤ 1, 5x1 + 5x2 ≥ 0 and x1 ≥ 0, x2 ≥ 0 using graphical method, we observe
Two kinds of foods A and B are being considered to form a weekly diet. The minimum weekly requirements of fats, Carbohydrates and proteins are 12, 16 and 15 units respectively. One kg of food A has 2, 8 and 5 units respectively of these ingredients and one kg of food B has 6, 2 and 3 units respectively. The price of food A is Rs. 4 per kg and that of food B is Rs. 3 per kg. Formulate the L.P.P. and find the minimum cost.
