Use the Tabu Search algorithm $to$ solve the following minimization problem, given the following

conditions: $(1)$ Step size: $x1=0\mathrm{.}5,x2=0\mathrm{.}5$; $(2)$ Initial solution $isatx1=0,x2=0.$ Try $to$

answer the following questions:

$(A)$ How many feasible solutions exist $in$ the solution space?

$(B)$ Design a Tabu List.

$(C)$ Draw a diagram $to$ illustrate the search path.

$(D)$ What $is$ the optimal solution value?

$(E)$ What percentage $of$ the feasible solutions has been explored?

$[Note$: $Do$ not use software $to$ visualize the entire solution space, and $do$ not look ahead $at$ the

location $of$ the optimal solution!$]$

MinZ$=1\mathrm{.}8x_1^2+0\mathrm{.}04x_1^4-0\mathrm{.}55x_1^3+2x_2^2+5$

$S.T.$

$-3\mathrm{.}5x_{1}12$

$-3\mathrm{.}0x_{2}6$