Extremal problems for convex polygons

DOI10.1007/S10898-006-9065-5zbMath1179.90306OpenAlexW2002285779MaRDI QIDQ2460117

Frédéric Messine, Pierre Hansen, Charles Audet

Publication date: 14 November 2007

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-006-9065-5

zbMATH Keywords

PolygonDiameterPerimeterWidthAreaIsodiametric problemIsoperimeter problemSum of distances

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Nonlinear programming (90C30) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items (18)

Global exact optimization for covering a rectangle with 6 circles ⋮ Extremal problems for spherical convex polygons ⋮ Asymmetric polygons with maximum area ⋮ Numerical certification of Pareto optimality for biobjective nonlinear problems ⋮ Open sets avoiding integral distances ⋮ Finding largest small polygons with gloptipoly ⋮ Maximal perimeter, diameter and area of equilateral unit-width convex polygons ⋮ A note on diameters of point sets ⋮ Piece adding technique for convex maximization problems ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ Recognition of largest empty orthoconvex polygon in a point set ⋮ Small polygons with large area ⋮ The small hexagon and heptagon with maximum sum of distances between vertices ⋮ The small octagons of maximal width ⋮ Enumerating isodiametric and isoperimetric polygons ⋮ Isoperimetric polygons of maximum width ⋮ Using symbolic calculations to determine largest small polygons ⋮ Characterization of extremal antipodal polygons

Uses Software

• KNITRO
• LANCELOT
• LOQO
• SNOPT
• filterSQP
• DONLP2
• MINOS
• COPS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A discrete isoperimetric problem
• The small octagon with longest perimeter
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• Unsolved problems in geometry
• A new reformulation-linearization technique for bilinear programming problems
• The largest small hexagon
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Averaging distances in real quasihypermetric Banach spaces of finite dimension
• The largest small \(n\)-dimensional polytope with \(n+3\) vertices.
• On extremal point disributions in the Euclidean plane
• Case studies in evolutionary experimentation and computation
• The largest small octagon
• The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal
• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• On convex polygons of maximal width
• Isodiametric problems for polygons
• A correction to ``The largest small \(n\)-dimensional polytope with \(n+3\) vertices [J. Combin. Theory Ser. A 102 (2003) 401-409]
• Über eine Punktverteilung auf der Kugel
• A $1 Problem
• Algorithme d'encadrement de l'optimum global d'une fonction différentiable
• The Isoperimetric Problem
• Global Optimization in Geometry — Circle Packing into the Square
• Deterministic global optimization using interval constraint propagation techniques
• On Sets of Distances of n Points
• A note on the sum of distances under a diameter constraint

This page was built for publication: Extremal problems for convex polygons