For each statement below (1-12) fill-in the blank with a letter to indicate the most appropriate choice from alternatives (A-J) shown in the list below. An alternative (letter) may be the most appropriate choice to more than one statement (number).

1. A discrete dynamic programming problem can be represented by a _________.
2. The transportation problem is a special case of the __________.
3. The _____ ____ is a discrete (having integer solutions) optimization problem.
4. Unless the Principle of Optimality holds, a problem cannot be formulated as a __________ problem.
5. The best algorithm for solving the _______ is a primal-dual algorithm.
6. The algorithms for solving the _________ are greedy in nature.
7. We cannot solve the __________ by simplex.
8. The basic solutions of the __________ are highly degenerate.
9. A __________ problem is solved by dividing it into smaller interrelated subproblems which are solved sequentially.
10. The maximum flow problem is a special case of the _________.
11. A minimizing discrete dynamic programming problem can be solved by the ______ algorithm (alternative to dynamic programming algorithm)
12. The assignment problem is a special case of the _________.

1. Transshipment Problem
2. Minimum Spanning Tree Problem
3. Dynamic Programming
4. Assignment Problem
5. Transportation Problem
6. Maximum Flow Problem
7. Minimum Cost Network Flow Problem
8. Generalized Assignment Problem
9. Shortest Path
10. Network