In a linear programming problem, the feasible region is defined by the constraints. Which of the following statements is true?
- The feasible region can be empty.
- The feasible region is always a convex set.
- An optimal solution must exist in the interior of the feasible region.
1
1 and 2
2
2 and 3
3
1 and 3
4
Only 1
5
Question Not Attempted