A linear programming problem has variables and an unbounded feasible region
MATHEMATICS · Single correct · CBSE · Mathematics · Linear Programming · Linear Programming
Problem
A linear programming problem has variables x,y≥0 and an unbounded feasible region. The objective function to be maximised is Z=5x+2y. Which one of the following facts about the feasible region guarantees that the problem will NOT have a finite maximum value?
(a) The feasible region is unbounded.
(b) The feasible region has exactly two corner points.
(c) The feasible region extends indefinitely in the direction of increasing values of 5x+2y.
(d) The feasible region extends indefinitely in the direction of decreasing values of 5x+2y."