A RECURSIVE ALGORITHM FOR FINDING THE MINIMUM NORM POINT IN AN UNBOUNDED POLYHEDRON

スポンサーリンク

概要

• 論文の詳細を見る

• We present a recursive algorithm for finding the minimum norm point in an unbounded, convex and pointed polyhedron defined by finite sets of points and rays. The algorithm can start at an arbitrary point of the polyhedron and does not require to solve systems of linear equations.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Sekitani Kazuyuki

  Department Of Industrial Administration Science University Of Tokyo

• Kise Wakasa

  Mitsubishi Electric Corporation

関連論文

• A UNIFIED MODEL AND ANALYSIS FOR AHP AND ANP
• A RECURSIVE ALGORITHM FOR FINDING THE MINIMUM NORM POINT IN AN UNBOUNDED POLYHEDRON

スポンサーリンク