A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES

• Fujishige Satoru

  Institute of Socio-Economic Planning, University of Tsukuba

• Zhan Ping

  Institute of Socio-Economic Planning, University of Tsukuba

Abstract

We propose a separating-hyperplane algorithm for finding a nearest pair of points in two polytopes, where each polytope is expressed as the convex hull of given points in a Euclidian space. The proposed algorithm is an extension of the authors dual algorithm for finding the minimum-norm point in a polytope.

Journal

• Journal of the Operations Research Society of Japan

  Journal of the Operations Research Society of Japan 35 (4), 353-365, 1992

  The Operations Research Society of Japan

Keywords

• Management Science and Operations Research
• General Decision Sciences

Details

• CRID: 1390282679085431936
• NII Article ID: 110001184365
• DOI: 10.15807/jorsj.35.353
• ISSN: 21888299
• ISSN: 04534514
• Web Site: https://www.jstage.jst.go.jp/article/jorsj/35/4/35_KJ00001202854/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
• Abstract License Flag: Disallowed