Consider the graphical solution space in Figure 3.8. Suppose that the simplex iterations start at A and that the optimum solution occurs at D. Further, assume that the objective function is defined such that at A, x1 enters the solution first.
(a) Identify (on the graph) the corner points that define the simplex method path to the optimum point.
(b) Determine the maximum possible number of simplex iterations needed to reach the optimum solution, assuming no cycling.