Optimization problems in planar geometry
Charles Audet · 2010
Attributes such as perimeter, area, diameter, sum of distances between vertices and width can be evaluated for every planar convex polygon. Fixing one of these attributes while minimizing of max- imizing another defines families of optimization problems.Some of these problems have a trivial solution, and several others have been solved, some since the Greeks, by geometrical reasoning. During the last four decades, this geometrical approach hasbeen complemented by global opti- mization methods. This combination allowed solution of instances than could be solved by any one of these two approaches alone. This talk surveys research onthat topic, and proposes directions for further work.