Match List-I with List-II
| List-I | List-II | ||
|---|---|---|---|
| Description | Term | ||
| (A) | The linear function \(Z = ax + by\) that has to be maximised or minimised | (I) | Constraints |
| (B) | The linear inequalities or equations that the variables must satisfy | (II) | Optimisation problem |
| (C) | The common region determined by all the constraints, including \(x \ge 0, y \ge 0\) | (III) | Objective function |
| (D) | A problem that seeks to maximise or minimise a linear function subject to linear inequalities | (IV) | Feasible region |
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → (A)-(III), (B)-(I), (C)-(IV), (D)-(II)
(A) The linear function \(Z = ax + by\) that has to be maximised or minimised is the objective function — (III).
(B) The linear inequalities or equations on the variables are the constraints — (I).
(C) The common region of all the constraints, including \(x \ge 0, y \ge 0\), is the feasible region — (IV).
(D) A problem of maximising or minimising a linear function subject to linear inequalities is an optimisation problem — (II).