Engineering: Largest small polygon¶
Direct download AIMMS Project
Problem type: NLP (small)
Description: Find the polygon with maximal area, among polygons with n sides and diameter \(d <= 1\). This problem has many local minima and therefore general nonlinear solvers are usually expected to find only local solutions.
References: Dolan, E.D., J.J. More, Benchmarking Optimization Software with COPS, 2000.