ACImplementation of the Reverse Search Vertex Enumeration Algorithm.pdf

下载文档

5
0
约4.04万字
约 16页
2017-04-09 发布于江苏
举报
版权申诉
保障服务

ACImplementation of the Reverse Search Vertex Enumeration Algorithm.pdf

1、本文档共16页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

ACImplementation of the Reverse Search Vertex Enumeration Algorithm

A C Implementation of the Reverse Search Vertex Enumeration Algorithm David Avis School of Computer Science McGill University 3480 University, Montreal, Quebec H3A 2A7 Revised June 1993 ABSTRACT This report documents a C implementation of the reverse search vertex enu- meration algorithm for convex polyhedra of Avis and Fukuda. The implementa- tion uses multiple precision rational arithmetic and contains a few improvements over the original algorithm, resulting in a small reduction in the complexity in most cases. For a polyhedron with n 0 inequalities in d non-negative variables and non-degenerate origin, it finds all bases in time O(n 0 d 2 ) per basis. It is also shown how the implementation can be improved to run in time O(n 0 d min(n 0 , d)) time per basis for any polyhedron. This implementation can handle problems of quite large size, especially for simple polyhedra (where each basis corresponds to a vertex). Computational experience is included in the report. 1. Background A new enumeration method called Reverse Search was recently introduced by Avis and Fukuda[1] (hereafter referred to as AF) and applied to the problem of finding all vertices of a convex polyhedron. This report documents a C implementation of the algorithm. The implemen- tation uses multiple precision rational arithmetic and contains a few improvements over the origi- nal algorithm. It can handle problems of quite large size, especially for simple polyhedra. Compu- tational experience is included in the report. This implementation in C was motivated by an earlier implementation by K. Fukuda and I. Mizukoshi in Mathematica[5]. Their implementation demonstrates the simplicity and effec- tiveness of the method, and provides impressive graphical output (see, eg. Figure 3.5). However, due to the inherent limitations of Mathematica, it is only computationally feasible for small prob- lems. The C implementation described here runs several hundred times faster for the medium sized problems described