3. Hooke and Jeeves' method may be used to solve constrained optimisation problems by the simple device of regarding as a failure any exploratory or pattern move which takes the current point out of the feasible region. (Work through the Hooke and Jeeves algorithm exactly as normal, but within that process classify any point outside the feasible region as a failure regardless of whether or not the function value is lower than previous values.) Use this technique to minimise f(x) = 3x, 2 2x1x2 + x 2x 2x2 subject to x1 + x2