A birdʹs eye-view of min-max and max-min functionals

Min-max and max-min functionals associated with convex and simple planar polygons are constructed using the functional definition. The algorithm employed is enumerative, the visual perspective is novel, and the general approach adopted to this class of optimization problem is both simple and geometrically satisfying.