A solution that satisfies all the constraints of a linear programming problem except the non negativity constraints is called:
A optimal
B. feasible
C. infeasible
D. semi-feasible
Answer:C
A solution that satisfies all the constraints of a linear programming problem except the non negativity constraints is called:
A optimal B. feasible C. infeasible D. semi-feasible