A three$-$dimensional solution space defined by linear constraints is shown in the figure below, The solution space has $10$ extreme points: $,0,$ and $\frac{?}{(0\mathrm{.}5,1,1)}.$ The objective function is: min $x_1^2=2x_2^2{x}_3+3x_3,$ Deginning at $x^{(0)}-=(x_1,x_2,x_3)=(0,5,0,5,0,5),$ exceute Improving Seareh Algorithm on the model, Limit your search to three directions, $x^{(1)}-=(1,1,-0\mathrm{.}5),x^{(2)}-=(-1,0,5,1),$ and $x^{(3)}-=(-1,0,-1),$ and continue until none is both improving and feasible.