.png){kind=icon}
Return
USING AHP FOR RESOURCE-ALLOCATION PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(93)E0240-X.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
AHP has been used for solving multi-criteria resource allocation problems by converting them into equivalent single objective, maximization-type LP problems. At least two approaches can be identified for such applications. In the first approach, the AHP priorities are used as coefficients in the objective function of the LP format, and in the second approach, the benefit-cost ratios are used as the coefficients. This paper evaluates the two approaches. It is shown here that both the approaches are suitable if the criteria (used in the AHP model) are sought to be maximized. However, they are shown to be inappropriate if the criteria are sought to be minimized. A new, simple approach is suggested for the latter case and an extension has been proposed to tackle problems with mixed criteria. The implications of the study on other preference elicitation methods have also been pointed out.
Keywords:
RESOURCE ALLOCATION
MULTIPLE CRITERIA
AHP
LINEAR PROGRAMMING
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
.png){kind=icon}
