Reconsider the linearly constrained convex programming model given in Prob. 13.9-11.

Follow the instructions of parts (a),

(b), and

(c) of Prob. 13.10-1 for this model, except use (x1, x2)

(

1 2

, 1 2

) as the initial trial solution and use r 1, 102

, 104

, 106

.