If a linear programming problem does not have an optimal solution then it must be infeasible

Question

Quizplus · Accepted Answer

If a linear programming problem does not have an optimal solution, it could be either infeasible or unbounded. Infeasible means there is no feasible solution that satisfies all constraints, while unbounded means there is no upper bound to the objective function. Therefore, not having an optimal solution does not necessarily mean the problem is infeasible.

If a Linear Programming Problem Does Not Have an Optimal