Which of the following is a characteristic of an "integer Linear Programming" problem?

a) The feasible region is always unbounded

b) Decision variables can take fractional values

c) Decision variables must be whole numbers

d) It uses nonlinear constraints