# Question: Consider the example for applying SUMT given in Sec 13 9 a

Consider the example for applying SUMT given in Sec. 13.9.

(a) Show that (x1, x2) = (1, 2) satisfies the KKT conditions.

(b) Display the feasible region graphically, and then plot the locus of points x1x2 = 2 to demonstrate that (x1, x2) = (1, 2) with f (1, 2) = 2 is, in fact, a global maximum.

(a) Show that (x1, x2) = (1, 2) satisfies the KKT conditions.

(b) Display the feasible region graphically, and then plot the locus of points x1x2 = 2 to demonstrate that (x1, x2) = (1, 2) with f (1, 2) = 2 is, in fact, a global maximum.

**View Solution:**## Answer to relevant Questions

Consider the following function: Show that f (x) is convex by expressing it as a sum of functions of one or two variables and then showing (see Appendix 2) that all these functions are convex. Reconsider the convex programming model with an equality constraint given in Prob. 13.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? Because of population growth, the state of Washington has been given an additional seat in the House of Representatives, making a total of 10. The state legislature, which is currently controlled by the Republicans, needs to ...While applying a simulated annealing algorithm to a certain problem, you have come to an iteration where the current value of T is T = 2 and the value of the objective function for the current trial solution is 30. This ...Reconsider the example of a traveling salesman problem shown in Fig. 14.4. (a) When the sub-tour reversal algorithm was applied to this problem in Sec. 14.1, the first iteration resulted in a tie for which of two sub-tour ...Post your question