The situation in which the value of the solution may be made infinitely large in a maximization linear programming problem or in
finitely small in a minimization problem without violating any of the constraints is known as Group of answer choices infeasibility. unbounded. infiniteness. semi-optimality.
Infeasibility, we have that a problem is unfeasible if there is not a solution that satisfies all the restrictions. Therefore this option is not.
Unbounded, we have a problem that has no limits if the objective function can be improved indefinitely without violating the constraints and limits, therefore this is the correct answer.
Infiniteness and semi-optimality, does not comply with what the situation exposes.