1. Assignment problems can never have more than one optimal solution.

True

False

2. The assignment algorithm can be used to solve both minimization problems and maximization problems.

True

False

3. In an assignment problem, a dummy source is given a very high cost for minimization problems and a low value for maximization problems so as to avoid going to the dummy first.

True

False

4. The objective of an assignment problem solution most often is to minimize the total costs or time of performing the assigned tasks.

True

False

Practically speaking, multiple optimal solutions ________.

5. In the assignment problem, the costs for a dummy row will be equal to the lowest cost of the column for each respective cell in that row.

True

False

6. Assignment problems involve determining the most efficient assignment of people to projects, salesmen to territories, contracts to bidders, and so on.

True

False

7. If an assignment problem is used to minimize cost, then the lowest cost of task to machine will always be a part of the optimal solution (i.e., the lowest number in the table).

True

False

8. A dummy person added to an assignment problem means that not all of the people will be used in the optimal solution.

True

False

9. provide management with greater flexibility in selecting and using resources

are unbalanced

are degenerate

are unbounded

are infeasible