A solution that satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called:

. A solution that satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called:

A optimal
B. feasible
C. infeasible
D. semi-feasible