True or False

In a linear programming problem, the objective function and the constraints must be linear functions of the decision variables.

The amount by which an objective function coefficient can change before a different set of values for the decision variables becomes optimal is the

	a.	optimal solution.
	b.	dual solution.
	c.	range of optimality.
	d.	range of feasibility.