Question: Consider the following one parameter family of linear programming problems (parametrized by μ):
Starting from μ = ∞, use the parametric simplex method to decrease μ until you get to μ = -∞.
Hint: the pivots are straight forward and, after the first couple, a clear pattern should emerge which will make the subsequent pivots easy. Clearly indicate the range of μ values for which each dictionary is optimal.