Consider the problem of minimising the Euclidean distance from the point (-4,5) in the plane to the set of points (x, y) that have integer coordinates and satisfy the inequality: x2 y² + ≤1. 4 9 (a) Use an exhaustive search to solve this problem. (b) Use a local search method to solve this problem. First, define the search space and the neighbourhood. Then, attempt to find the minimum starting from the initial point (x, y) = (2,0). The neighbourhood of a point should contain at least two distinct points but must not encompass the entire feasible search space. Will your local search method find the global optimum?

Consider the relation ✓ on R² defined by u ≤ v u₁ + v₂+ 3u1 v² < u₂ + v³ + 3u²v₁ (u³ + v2 + 3u1v = u₂+ v³ + 3u²v₁ and u₂ < v2) u = v for any u, vЄR² with u = = (u1, u2), v = = (V1, V2). or 우우 or 1. Prove that the relation ✓ is translation invariant. Hint: Use the formula of (a + b)³ for a, b = R. 2. Is the relation ✓ scale invariant? Justify your answer. 3. Is the relation ✓ reflexive? Justify your answer. 4. Is the relation ✓ transitive? Justify your answer. 5. Is the relation ✓ antisymmetric? Justify your answer. 6. Is the relation ✓ total? Justify your answer. 7. Is the relation ✓ continuous at zero? Justify your answer.

Let X = [−1, 1] C R and consider the functions ₤1, f2 : X → R to be minimised, where f₁(x) = x + x² and f2(x) = x-x² for all x Є X. Solve the tradeoff model minøx µƒ₁(x)+ƒ2(x), for all values of µ ≥ 0. Show your working.