Extremal problems for convex polygons

DOI10.1007/S10898-006-9065-5zbMATH Open1179.90306OpenAlexW2002285779MaRDI QIDQ2460117FDOQ2460117

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

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

Recommendations

• scientific article; zbMATH DE number 5589231
• An extremum problem for convex polygons
• Tight bounds on the maximal perimeter and the maximal width of convex small polygons
• Isodiametric problems for polygons
• Maximal perimeter, diameter and area of equilateral unit-width convex polygons

zbMATH Keywords

DiameterPolygonPerimeterWidthAreaIsodiametric problemIsoperimeter problemSum of distances

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (37)

• Crystals, gauges, podals, and polars.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recognition of largest empty orthoconvex polygon in a point set
• Enumerating isodiametric and isoperimetric polygons
• Finding Extremal Polygons
• Isoperimetric polygons of maximum width
• Extremal polygon containment problems
• An extremum problem for the power moment of a convex polygon contained in a disc
• Global exact optimization for covering a rectangle with 6 circles
• Extremal areas of polygons with fixed perimeter
• A note on diameters of point sets
• Piece adding technique for convex maximization problems
• Extremal area of polygons sliding along curves
• On convex polygons of maximal width
• The small octagons of maximal width
• Asymmetric polygons with maximum area
• A literature review on circle and sphere packing problems: models and methodologies
• Extremal problems for spherical convex polygons
• Finding largest small polygons with gloptipoly
• Using symbolic calculations to determine largest small polygons
• The small hexagon and heptagon with maximum sum of distances between vertices
• Inpolygons of minimal diameter
• Open sets avoiding integral distances
• Numerical certification of Pareto optimality for biobjective nonlinear problems
• Largest small polygons: a sequential convex optimization approach
• Extremal problems for framed polygons
• On the mean length of the diagonals of an \(n\)-gon
• An extremum problem for convex polygons
• Title not available (Why is that?)
• Small polygons with large area
• Characterization of extremal antipodal polygons
• Title not available (Why is that?)
• Maximal perimeter, diameter and area of equilateral unit-width convex polygons
• Some extremal problems for polygons in the Euclidean plane
• Title not available (Why is that?)

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460117)