The paper answers the three distinct questions of maximizing the perimeter, diameter and area of equilateral unit-width convex polygons. The solution to each of these these problems is trivially unbounded when the number of sides is even. We show that when the number is odd, the optimal solution to these three problems is identical, and arbitrarily close to a trapezoid.