Reconsider the convex programming model with an equality constraint given in Prob. 12.6-11.

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

D,C

(b) Starting from the initial trial solution (x1, x2, x3)
(

3 2

, 

3 2

, 2), use the automatic procedure in your IOR Tutorial to apply SUMT to this model with r
102

, 104

, 106

, 108

.

C

(c) Use the standard Excel Solver to solve this problem.

C

(d) Use Evolutionary Solver to solve this problem.

C

(e) Use LINGO to solve this problem.