Please answer question 1 **Optimization Problem Analysis***Objective:*Consider the set \( S \) composed of points on the line segment \( S_1 \) between points \((-1, 0)\) and \((2, 0)\), and on the line segment \( S_2 \) between points \((0, -1)\) and \((0, 3)\). We are interested in the optimization problem:\[ z^* := \min \{ (x-3)^2 + x^2y^2 + (y-2)^2 \mid (x, y) \in S \}.\]Note that \( z^* \leq 5 \) since \((x, y) = (2, 0)\) is a feasible solution to this problem.*Tasks:*1. **Condition for Convex Set:** Determine conditions on the values of \( a, b, c, \) and \( d \) for which the set \[ E = \{ (x, y) \in \mathbb{R}^2 \mid a(x-c)^2 + b(y-d)^2 \leq 1 \} \] is convex and such that \( S \subseteq E \).2. **Smallest Convex Set \( E_1 \):** Determine the values of \( a \) and \( b \) that lead to the smallest (based on area) convex set \[ E_1 = \{ (x, y) \in \mathbb{R}^2 \mid a(x)^2 + b(y)^2 \leq 1 \} \] such that \( S \subseteq E_1 \).3. **Smallest Convex Set \( E_2 \):** Determine the values of \( a \) and \( b \) that lead to the smallest (based on area) convex set \[ E_2 = \{ (x, y) \in \mathbb{R}^2 \mid a(x-1)^2 + b(y-1)^2 \leq 1 \} \] such that \( S \subseteq E_2 \).4. **Polyhedron \( P_3 \):** Derive a polyhedron \( P_3 \subseteq \mathbb

Answered: Image /qna-images/answer/2fcdf1f6-0de7-480e-bdcc-1d335d3ee0b0.jpg

Consider the set S composed of the points on the line segment S₁ between points (-1,0) and (2,0) and of the points on the line segment S2 between points (0, -1) and (0, 3). We are interested in the optimization problem min{(x - 3)² + x²y² + (y - 2)² | (x, y) = S}. Note that z* 5 since (x, y) = (2,0) is a feasible solution to this problem. 1. Determine conditions on the values of a, b, c and d for which the set {(x, y) = R² | a(x - c)² + b(yd)² ≤ 1} E = is convex and is such that SCE.