Concept:Formulate the given real-world production problem as a Linear Programming Problem (L.P.P.) by converting time limits into constraints and profit into the objective function.
Explanation:Let
x be the number of items of A and
y be the number of items of B.
Since production cannot be negative,
x≥0 and
y≥0.
Machine I can work for maximum
10 hours
40 minutes
=(10×60)+40=640 minutes.
Time taken by Machine I:
20 minutes for A and
15 minutes for B.
So, the constraint is
20x+15y≤640.
Machine II can work for maximum
8 hours
20 minutes
=(8×60)+20=500 minutes.
Time taken by Machine II:
5 minutes for A and
8 minutes for B.
So, the constraint is
5x+8y≤500.
Profit per item is ₹
25 for A and ₹
18 for B.
Total profit is
z=25x+18y, which is to be maximized.
Answer:Maximize
z=25x+18ysubject to
20x+15y≤6405x+8y≤500x,y≥0Hence, the correct option is
B.