Consider the solution space in Figure 4.3, where it is desired to find the optimum extreme point that uses the dual simplex method to minimize z = 2x1 + x2. The optimal solution occurs at point F = 10.5, 1.52 on the graph.

(a) Can the dual simplex start at point A?

*

(b) If the starting basic (infeasible but better than optimum) solution is given by point G with the optimum given by point F, would it be possible for the iterations of the dual simplex method to follow the path GS E S F? Explain.

(c) If the starting basic (infeasible) solution starts at point L, identify a possible path of the dual simplex method that leads to the optimum feasible point at point F.