| Article ID: | iaor19891108 |
| Country: | Netherlands |
| Volume: | 8 |
| Issue: | 5 |
| Start Page Number: | 261 |
| End Page Number: | 264 |
| Publication Date: | Oct 1989 |
| Journal: | Operations Research Letters |
| Authors: | Kang Do Ba, Fujiware Okitsugu |
This paper presents a new algorithm to find all the vertices of a polytope using a polyhedral annexation method. The algorithm exploits the vertex-facet duality correspondence between a polytope and its polar set to construct an increasing sequence of polytopes whose vertices are included in the vertex-set of the original polytope.