This can also be treated as an optimization problem. So, we need to determine the quantity that we want to optimize. We want to determine the point on the given ellipse, , that is closest to the point .
Thus, we want to minimize the distance between the two points which we will denote by, . We obtain an expression for using the formula for distance between two points:

Our constraint in this problem is that the point must lie on the ellipse,

Replacing in our expression for with what is given by our constraint, we obtain

To minimize , we need to determine the critical points of . So we compute and set it to zero.

The solution to the above equation is x = 1/2. To figure out the corresponding value(s) of , we substitute the value into the equation of the ellipse:

So there are two critical points on the ellipse:

The distance between each of these points and P is the same:

We also need to consider the distance between P and the left and right-most points of the ellipse, which occur at (-3,0) and (3,0). Computing value of for each of these points gives approximately equal to 3.444 and 2.556, respectively. The distances between P and each of the two endpoints are both larger than the distance between the first two points that we found. Therefore, the (x,y) coordinates of the points that minimize the distance between the ellipse and P are:

|