A potter makes x mugs and y vases in a week. A mug needs 1 kg of clay and a vase needs 3 kg of clay, and 60 kg of clay is available in a week. The profit is Rs. 80 on a mug and Rs. 200 on a vase. Match List-I with List-II for the linear programming problem of maximising the potter’s profit.
| List-I | List-II |
|---|---|
| (A) Decision variables | (I) \(x \ge 0,\ y \ge 0\) |
| (B) Objective function | (II) \(x + 3y \le 60\) |
| (C) Constraint on clay | (III) x and y |
| (D) Non-negative restrictions | (IV) \(Z = 80x + 200y\) |
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → (A)-(III), (B)-(IV), (C)-(II), (D)-(I)
In an LPP the decision variables are the quantities to be decided, the objective function is the quantity to be maximised or minimised, and the constraints are the limits on the variables.
(A) Decision variables
The potter decides how many mugs and vases to make, so these are (III) x and y.
(B) Objective function
The profit on x mugs and y vases is (IV) \(Z = 80x + 200y\), which is to be maximised.
(C) Constraint on clay
x mugs use x kg and y vases use 3y kg, at most 60 kg in all, so (II) \(x + 3y \le 60\).
(D) Non-negative restrictions
The numbers of mugs and vases cannot be negative, so (I) \(x \ge 0,\ y \ge 0\).