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 |
| Summary: | 碩士 === 國立交通大學 === 資訊管理研究所 === 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 with incomplete infor- mation
into a 0-1 fractional programming problem.This 0-1 fractional
programming problem is then linearized as a 0-1 programming
which is sloved by a branch-bound method to obtain a global
solution. Some numerical testing examples show that the
proposal method is superior to Satty''s method in following
points: 1.decision makers are allowed not to weight all of
pairwise criteria. 2.the obtained solution is the global
optimal solution. 3.allow a decision maker to specify his
"confidence level" and enhance the reliablity and flexibility
of AHP method.
|
|---|