Problem 4-35 - 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=2x, +X,. The optimal solution occurs at point F=(0.5,1.5) 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 G+EF? Explain. 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. Figure 4-3 Solution Space for Problem 4-35 AV BILIK 2 3 4 5 6 7 1 1