A. Infeasible
B. Unbounded
C. Alternative
D. None of the above
✅ The correct answer is option A.
If the feasible region of a LPP is empty, the solution is infeasible. A linear program is infeasible if there exists no solution that satisfies all of the constraints — in other words, if no feasible solution can be constructed. Since any real operation that you are modelling must remain within the constraints of reality, infeasibility most often indicates an error of some kind. Simplex-based LP software like lp_solve efficiently detects when no feasible solution is possible.
If the feasible region of a LPP is empty, the solution is infeasible. A linear program is infeasible if there exists no solution that satisfies all of the constraints — in other words, if no feasible solution can be constructed. Since any real operation that you are modelling must remain within the constraints of reality, infeasibility most often indicates an error of some kind. Simplex-based LP software like lp_solve efficiently detects when no feasible solution is possible.