In a Linear programming problem.
Match List – I with List – II.
| LIST I | LIST II |
| A. restrictions on the variables are | I. unbounded |
| B. Function to be optimized is | II. feasible |
| C. Region determined by all linear inequalities is | III. constraints |
| D. Optimal value may or may not exist if the solution region is | IV. objective |
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
These are the basic terms of linear programming.
(A) restrictions on the variables are
This matches (III) constraints: the linear inequalities that the variables must satisfy.
(B) Function to be optimized is
This matches (IV) objective: Z = ax + by is the objective function.
(C) Region determined by all linear inequalities is
This matches (II) feasible: the common region of all constraints is the feasible region.
(D) Optimal value may or may not exist if the solution region is
This matches (I) unbounded: on an unbounded region the maximum or minimum may fail to exist.