Reconsider the model given in Prob. 13.3-3.

(a) If SUMT were to be applied directly to this problem, what would be the unconstrained function P(x; r) to be minimized at each iteration?

(b) Setting r 100 and using (x1, x2) (5, 5) as the initial trial solution, manually apply one iteration of the gradient search procedure (except stop before solving for t*) to begin minimizing the function P(x; r) you obtained in part (a).

D,C

(c) Beginning with the same initial trial solution as in part (b), use the automatic routine in your OR Courseware to apply SUMT to this problem with r 100, 1, 102

, 104

.

(Hint: The computer routine assumes that the problem has been converted to maximization form with the functional constraints in form.)