For an optimization problem a(an) __________________ violates at least one of the constraints.
A) infeasible solution
B) inoptimal solution
C) suboptimal solution
D) unbounded solution
E) simplex solution

Question

Quizplus · Accepted Answer

An infeasible solution violates at least one of the constraints, making it impossible to achieve. Therefore, A is the best choice for this question. The other options, B through E, do not necessarily violate any constraints: a suboptimal solution may meet all the constraints but be less than optimal, an unbounded solution means there is no limit to the objective function within the constraints, and a simplex solution refers to the algorithm used to solve linear programming problems.

For an Optimization Problem A(an) __________________ Violates at Least One