Without satisfying the non-negativity constraint, a solution that satisfies all the other constraints of a linear programming problem is called
A) feasible.
B) infeasible.
C) semi-feasible.
D) optimal.

Question

Quizplus · Accepted Answer

A solution that does not satisfy all the constraints, including the non-negativity constraint, of a linear programming problem is considered infeasible.

Without Satisfying the Non-Negativity Constraint, a Solution That Satisfies All