Let \(R\) be the feasible region for a linear programming problem. Suppose \(R\) is unbounded then |
Maximum or minimum value of the objective function always exist. Maximum or minimum value of the objective function may not exist. Both \((i)\) and \((ii)\) are true None of the above |
Maximum or minimum value of the objective function may not exist. |
Try examples |