Article ID: | iaor20061010 |
Country: | United Kingdom |
Volume: | 32 |
Issue: | 4 |
Start Page Number: | 793 |
End Page Number: | 812 |
Publication Date: | Apr 2005 |
Journal: | Computers and Operations Research |
Authors: | Falk James E., Yepremyan Lusine |
Keywords: | sets |
Using a pair of theorems linking Delaunay partitions and linear programming, we develop a method to generate all simplices in a Delaunay partition of a set of points, and suggest an application to a piecewise linear non-convex optimization problem. The same method is shown to enumerate all facets of a polytope given as the convex hull of a finite set of points. The dual problem of enumerating all vertices of a polytope