Question 2 The answer to each of these questions should be 2-3 sentences. (a) Consider a step of the simplex method in which the value of the slack variable wi (associated with constraint 1) decreases. What can we say about the new coordinate with respect to constraint 1? (b) Under what condition will a linear program have more than one solution? If we attempt to solve a linear program with more than one solution via the simplex method, what issue arises? (c) The simplex method always seeks a maximum solution for the objective function. What changes can be made to the method in order to seek a minimum solution? (d) While performing the simplex method on an arbitrary set of constraints, we considered two issues that could arise: unboundedness and initialization. Explain what each of these issues mean geometrically and how they present themselves when performing the simplex method. Question 2 The answer to each of these questions should be 2-3 sentences. (a) Consider a step of the simplex method in which the value of the slack variable wi (associated with constraint 1) decreases. What can we say about the new coordinate with respect to constraint 1? (b) Under what condition will a linear program have more than one solution? If we attempt to solve a linear program with more than one solution via the simplex method, what issue arises? (c) The simplex method always seeks a maximum solution for the objective function. What changes can be made to the method in order to seek a minimum solution? (d) While performing the simplex method on an arbitrary set of constraints, we considered two issues that could arise: unboundedness and initialization. Explain what each of these issues mean geometrically and how they present themselves when performing the simplex method