Mathematics and Statistics Vol. 9(3), pp. 233 - 242
DOI: 10.13189/ms.2021.090304
Reprint (PDF) (602Kb)

Relative Complexity Index for Decision-Making Method

Harliza Mohd Hanif *, Daud Mohamad , Rosma Mohd Dom
Faculty of Computer & Mathematical Sciences, University Teknologi MARA, 40450 Shah Alam, Selangor Darul Ehsan, Malaysia


The complexity of a method has been discussed in the decision-making area since complexity may impose some disadvantages such as loss of information and a high degree of uncertainty. However, there is no empirical justification to determine the complexity level of a method. This paper focuses on introducing a method of measuring the complexity of the decision-making method. In the computational area, there is an established method of measuring complexity named Big-O Notation. This paper adopts the method for determining the complexity level of the decision-making method. However, there is a lack of applying Big-O in the decision-making method. Applying Big-O in decision-making may not be able to differentiate the complexity level of two different decision-making methods. Hence, this paper introduces a Relative Complexity Index (RCI) to cater to this problem. The basic properties of the Relative Complexity Index are also discussed. After the introduction of the Relative Complexity Index, the method is implemented in Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) method.

Complexity, Relative Complexity Index, Big-O Notation

Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] Harliza Mohd Hanif , Daud Mohamad , Rosma Mohd Dom , "Relative Complexity Index for Decision-Making Method," Mathematics and Statistics, Vol. 9, No. 3, pp. 233 - 242, 2021. DOI: 10.13189/ms.2021.090304.

(b). APA Format:
Harliza Mohd Hanif , Daud Mohamad , Rosma Mohd Dom (2021). Relative Complexity Index for Decision-Making Method. Mathematics and Statistics, 9(3), 233 - 242. DOI: 10.13189/ms.2021.090304.