1. Given the computer tout est Excel sensitivity reports to a linear program, how can you tell if: a) The optimal solution is degenerate. by The optimal solution is not unique. 2. In the transportation problem, when do we adjust the demand constraints to less-then-or-equal instead of equal)? Alternatively, when do we adjust the supply constraints to less than or equal instead of equal)? UNG 110 AM 12021 a) The mastion is not unique 2. In the transportation problem when do we adjust the demand constraints to less then or equal tinstead of equaly? Alternate when do we adjust the supply constraints to less than or equal instead of equal Assura transportation problem with four origins and seven destinations, how many decision variables and functional constraints will the linear programming formulation for the problem have? 4. in the Hungariant algorithm why do we stop the solution process when the minimum number of lines needed to cover all theros seualto S. Assume that you are given a linear program along with its optimal solution. You are then told that both cy and c2 values are charged simultaneously. Explain how you can tell if the current optimal solution would remain optimal WALTO 1912 AM 1. Given the computer tout est Excel sensitivity reports to a linear program, how can you tell if: a) The optimal solution is degenerate. by The optimal solution is not unique. 2. In the transportation problem, when do we adjust the demand constraints to less-then-or-equal instead of equal)? Alternatively, when do we adjust the supply constraints to less than or equal instead of equal)? UNG 110 AM 12021 a) The mastion is not unique 2. In the transportation problem when do we adjust the demand constraints to less then or equal tinstead of equaly? Alternate when do we adjust the supply constraints to less than or equal instead of equal Assura transportation problem with four origins and seven destinations, how many decision variables and functional constraints will the linear programming formulation for the problem have? 4. in the Hungariant algorithm why do we stop the solution process when the minimum number of lines needed to cover all theros seualto S. Assume that you are given a linear program along with its optimal solution. You are then told that both cy and c2 values are charged simultaneously. Explain how you can tell if the current optimal solution would remain optimal WALTO 1912 AM