1. Given the computer output (example: Excel sensitivity report) to a linear program, how can you tell if:

A) the optimal solution is degenerate?

b) the optimal solution is not unique?

2. in the tranportation problem, when do we adjust the demand constraints to less than or equal (instead of equal)? Alternatively wjen so we adjust the supply constraints to less than or equal (instead of equal)?

3. Assuming a transportation problem with 4 origins and 7 destinations, how many decision variables ans functional constraints will the linear programminf formulation for the problem have?

4. in the hungarian algorithm, why do we stop the solution process when the minimum number of lines needed to cover all the zeros is equal to n?

5. Assume that you are given a linear program along with its optimal solution. you are then told that both C1 and C2 values are changed simultaneously. Explain how you can tell if the current optimal solution would remain optimal