1. Given that the transportation simplex method is being used to solve a maximization problem, how do you know that you have reached an optimal solution?

2. In the assignment problem, assume:

• A worker must perform a minimum of one task.
• A task maybe performed by a maximum of two workers.

Present the complete mathematical model for the problem under the above assumptions. You may use the compact form.

3. For the maximal flow problem, how would one establish a limit on the amount of flow through the network without actually solving the question? Explain.

4. What is the interpretation of the reduced cost values (e_ij) in the transportation simplex method.