In the context of linear programming,
Match List I with List II.
| LIST I | LIST II |
| A. Z = 250x + 75y | I. non-trivial constraints |
| B. \(5x+y \le 100,\ x-y \le 4\) | II. feasible solution |
| C. \(x, y \ge 0\) | III. objective function |
| D. points within and on the boundary of the shaded region | IV. trivial constraints |
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 1
The correct answer is Option (1) → A-III, B-I, C-IV, D-II
(A) Z = 250x + 75y
This matches (III) objective function: it is the linear function to be maximised or minimised.
(B) \(5x+y \le 100,\ x-y \le 4\)
This matches (I) non-trivial constraints: these are the restrictions that come from the problem itself (resources, limits).
(C) \(x, y \ge 0\)
This matches (IV) trivial constraints: the non-negative constraints, which hold in every LPP.
(D) points within and on the boundary of the shaded region
This matches (II) feasible solution: each point of the feasible region (inside or on its boundary) satisfies all the constraints.