The feasible region of a linear programming problem is given by
and the objective function is , where is a real constant. The set of all values of for which the minimum value of on is attained at infinitely many points is
Confirming your payment
Competency-Based Questions (CBQ) · Question 69 of 80
The feasible region of a linear programming problem is given by
and the objective function is , where is a real constant. The set of all values of for which the minimum value of on is attained at infinitely many points is
(A) or
(B) only
(C)
(D)
Option (A) is correct.
The region. is the strip above the line . Its corners are and , and it is unbounded upwards along and . Here and .
Write and use , .
So the minimum is attained at infinitely many points exactly when or .
(B) is wrong: it finds the tie but misses , where the minimum is attained along the unbounded ray , .
(C) is wrong: for , say, and , and is attained only at .
(D) is wrong: for , say, , and the minimum is attained only at .