Solving AHP Problems under Incomplete Information using 0-1 Fractional Programming
碩士 === 國立交通大學 === 資訊管理研究所 === 81 === Traditional AHP methods can only slove decision problemswith complete information. This study prposes an optimization thod for solvig AHP problems with icomplete or noisy information. We first transform an AHP problem...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
1993
|
Online Access: | http://ndltd.ncl.edu.tw/handle/87187296231987094978 |