Consider a convex polygon V_n with n sides, perimeter P_n, diameter D_n, area A_n, sum of distances between vertices S_n and width W_n. Minimizing or maximizing any of these quantities while fixing another defines ten pairs of extremal polygon problems (one of which usually has a trivial solution or no solution at all). In a previous paper, we surveyed research on these problems up to 2005. It appears that geometric reasoning is increasingly complemented by global optimization methods. As several new results have been obtained very recently, we present an update to that survey.