Consider the problem of finding the shortest distance between the circular and elliptic disks shown in Fig. P13.13. Using the following ‘sequential QP’ approach, obtain an approximate solution of the...

Consider the problem of finding the shortest distance between the circular and elliptic disks shown in Fig. P13.13. Using the following ‘sequential QP’ approach, obtain an approximate solution of the problem: (i) Replace the disks by polygons with, say, k edges that approximate the circle and ellipse from either inside or outside; (ii) formulate the problem of finding the shortest distance between the two polygons as a QP problem; (iii) apply one of the gorithms described in Sec. 13.4 to find a solution of the QP problem; (iv) improve the solution accuracy by increasing the number of edges, k, of each of the two polygons.