3-27. Consider the two-dimensional solution space in Figure 3.17. (a) Suppose that the objective function is given as Maximize z = 6x1 + 3x2 If the simplex iterations start at point A, identify the path to the optimum point D. (b) Determine the entering variable, the corresponding ratios of the feasibility condi- tion, and the change in the value of z, assuming that the starting iteration occurs at point A and that the objective function is given as Maximize z = x1 + 4x2 FIGURE 3.17 X2 Solution Space for Problem 3-27 4 3 2 F E D G A B X1 0 2 3 4 5 -1