Test 3 true false 5

A change in the value of an objective function coefficient will always change the value of the optimal solution.

False

A non-binding constraint is always a redundant constraint.

False

A variable is a value that is usually a coefficient of a parameter in an equation.

False

An extreme point is an optimal solution.

False

Most computer linear programming packages readily accept constraints entered in fractional form, such as X1/X3.

False

Sensitivity ranges can be computed only for the right-hand sides of constraints.

False

Binding constraints are the constraints which intersect at the optimal solution point.

True

Linear programming problems can be formulated both algebraically and on spreadsheets.

True

Sensitivity analysis determines how a change in a parameter affects the optimal solution.

True

The values of decision variables are continuous or divisible.

True