Match the LIST-I with LIST-II
| LIST-I | LIST-II | ||
| A. | In a L.P.P the objective function is always | I. | Finite |
| B. | Feasible region for an L.P.P is always a | II. | Convex set |
| C. | In an L.P.P having bounded feasible region, the maximum value of the objective function \( z=ax+by \) is always | III. | Linear |
| D. | Feasible region is the set of points which satisfy | IV. | All the given constraints |
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → A-III, B-II, C-I, D-IV
(A) In a L.P.P the objective function is always
This matches (III) Linear. In a linear programming problem the objective function has the form z = ax + by.
(B) Feasible region for an L.P.P is always a
This matches (II) Convex set. It is the common part of half-planes, and the segment joining any two of its points lies inside it.
(C) In an L.P.P having bounded feasible region, the maximum value of z = ax + by is always
This matches (I) Finite. By the corner point theorem, on a bounded region z has a maximum (and a minimum), attained at a corner point.
(D) Feasible region is the set of points which satisfy
This matches (IV) All the given constraints, including the non-negativity constraints.
So the matching is (A)-(III), (B)-(II), (C)-(I), (D)-(IV).