Linear Programming Quiz

Indicate whether the statement is true or false. 1. Only binding constraints form the shape (boundaries) of the feasible region.

• True

• False

A linear programming problem can be both unbounded and infeasible. 2. True or False?

• True

• False

An infeasible problem is one in which the objective function can be increased to infinity. 3. True or False?

• True

• False

An unbounded feasible region might not result in an unbounded solution for a minimization or maximization problem. 4. True or False?

• True

• False

An optimal solution to a linear programming problem can be found at an extreme point of the feasible region for the problem. 5. True or False?

• True

• False

The constraint 2x1 − x2 = 0 passes through the point (200, 100). 6. True or False?

• True

• False

The point (3, 2) is feasible for the constraint 2x1 + 6x2 ≤ 30. 7. True or False?

• True

• False

Alternative optimal solutions occur when there is no feasible solution to the problem. 8. True or False?

• True

• False

A redundant constraint cannot be removed from the problem without affecting the feasible region. 9. True or False?

• True

• False

For a minimization problem, the solution is considered to be unbounded if the value may be made infinitely small. 10. True or False?

• True

• False