In the graphical model of linear programming the region defined by the constraints and the non-negative restrictions is the:
A
non-negativity restrictions
B
objective function
C
feasible solution region
D
constraints
E
None of the above
Correct Answer: feasible solution region