Computational experience with the reverse search vertex enumeration algorithm

Computational experience with the reverse search vertex enumeration algorithm

0.00 Avg rating0 Votes
Article ID: iaor20002401
Country: United States
Volume: 10
Issue: 2
Start Page Number: 107
End Page Number: 124
Publication Date: Aug 1998
Journal: Optimization Methods & Software
Authors:
Keywords: programming: linear
Abstract:

This paper describes computational experience obtained in the development of the IRS code, which uses the reverse search technique to solve the vertex enumeration/convex hull problem for d-dimensional convex polyhedra. We give empirical results showing improvements obtained by the use of lexicographic perturbation, lifting, and integer pivoting. We also give some indication of the cost of using extended precision arithmetic and illustrate the use of the estimation function of IRS. The empirical results are obtained by running various versions of the program on a set of well-known non-trivial polyhedra: cut, configuration, cylic, Kuhn–Quandt, and metric polytopes.

Reviews

Required fields are marked *. Your email address will not be published.