# Question: Consider the following problem Maximize Z 4x1 x12

Consider the following problem:

Maximize Z = 4x1 – x12 + 10x2 – x22,

subject to

x12 + 4x22 ≤ 16 and

x1 ≥ 0, x2 ≥ 0.

(a) Is this a convex programming problem? Answer yes or no, and then justify your answer.

(b) Can the modified simplex method be used to solve this problem? Answer yes or no, and then justify your answer (but do not actually solve).

(c) Can the Frank-Wolfe algorithm be used to solve this problem? Answer yes or no, and then justify your answer (but do not actually solve).

(d) What are the KKT conditions for this problem? Use these conditions to determine whether (x1, x2) = (1, 1) can be optimal.

(e) Use the separable programming technique to formulate an approximate linear programming model for this problem. Use the feasible integers as the breakpoints for each piecewise linear function.

(f) Use the simplex method to solve the problem as formulated in part (e).

(g) Give the function P(x; r) to be maximized at each iteration when applying SUMT to this problem. (Do not actually solve.)

Maximize Z = 4x1 – x12 + 10x2 – x22,

subject to

x12 + 4x22 ≤ 16 and

x1 ≥ 0, x2 ≥ 0.

(a) Is this a convex programming problem? Answer yes or no, and then justify your answer.

(b) Can the modified simplex method be used to solve this problem? Answer yes or no, and then justify your answer (but do not actually solve).

(c) Can the Frank-Wolfe algorithm be used to solve this problem? Answer yes or no, and then justify your answer (but do not actually solve).

(d) What are the KKT conditions for this problem? Use these conditions to determine whether (x1, x2) = (1, 1) can be optimal.

(e) Use the separable programming technique to formulate an approximate linear programming model for this problem. Use the feasible integers as the breakpoints for each piecewise linear function.

(f) Use the simplex method to solve the problem as formulated in part (e).

(g) Give the function P(x; r) to be maximized at each iteration when applying SUMT to this problem. (Do not actually solve.)

## Relevant Questions

Ever since the day she took her first economics class in high school, Lydia wondered about the financial practices of her parents. They worked very hard to earn enough money to live a comfortable middle-class life, but they ...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 ...Consider an 8-city traveling salesman problem (cities 1, 2, . . . , 8) where city 1 is the home city and links exist between all pairs of cities. For each of the following pairs of parents, generate their two children when ...Reconsider the traveling salesman problem shown in Prob. 14.1-1. Starting with 1-2-4-3-5-1 as the initial trial solution, apply the basic tabu search algorithm by hand to this problem. Consider the following parlor game between two players. It begins when a referee flips a coin, notes whether it comes up heads or tails, and then shows this result to player 1 only. Player 1 may then (i) pass and thereby pay ...Post your question