Question: Consider the following linear programming problem:
Suppose that, in solving this problem, you have arrived at the following dictionary:
(a) Write down the dual problem.
(b) In the dictionary shown above, which variables are basic? Which are nonbasic?
(c) Write down the primal solution corresponding to the given dictionary. Is it feasible? Is it degenerate? (d) Write down the corresponding dual dictionary.
(e) Write down the dual solution. Is it feasible?
(f) Do the primal/dual solutions you wrote above satisfy the complementary slackness property?
(g) Is the current primal solution optimal?
(h) For the next (primal) pivot, which variable will enter if the largest coefficient rule is used? Which will leave? Will the pivot be degenerate?