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:

A - I, B - II, C - IV, D - III A - III, B - II, C - IV, D - I A - III, B - IV, C - II, D - I A - II, B - IV, C - I, D - III

A - III, B - IV, C - II, D - I

The correct answer is Option (3) → A - III, B - IV, C - II, D - I