A new algorithm to find all vertices of a polytope

  • Authors:

  • Do Ba Khang;Okitsugu Fujiwara

  • Affiliations:

  • Division of Industrial Engineering and Management, Asian Institute of Technology, P.O. Box 2754, Bangkok, 10501 Thailand;Division of Industrial Engineering and Management, Asian Institute of Technology, P.O. Box 2754, Bangkok, 10501 Thailand

  • Venue:
  • Operations Research Letters
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.