2001•Mathematical communicationsOpen access

Improvement of AHP method

Lavoslav Čaklović, Ružica Piskač, Vedran Šego

Abstract

Here we propose a new ranking method for AHP, Potential method, based on Graph theory approach. This method works fine in the case when AHP-matrix is not complete. It makes easy to define an index of inconsistency of given data in a very natural way. The main purpose of this article is to examine the behaviour of rank order under successive neglecting of data in AHP-matrix preserving the graph connectedness. As we will show, the same ranking order is obtained for complete and incomplete AHP-matrix.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Analytic hierarchy process, Social connectedness, Ranking (information retrieval), Rank (graph theory), Graph, Computer science, Graph theory, Matrix (chemical analysis)