On qualitatively consistent,transitive and contradictory judgment matrices emerging from multiattribute decision procedures

Several known and newly introduced classes of positive reciprocal matrices emerging from pairwise comparisons in multiattribute decision problems are studied in the paper. Mainly qualitative features in connection with consistency and inconsistency are considered in order to extend the range of the available analytical methods regarding pairwise comparisons. By using graph representation of positive reciprocal matrices, graph theoretic approach is applied for the argumentation. The applied notions and the theorems developed in the paper can be useful for eliminating the illogical data that may occur during pairwise comparisons.     

Strong reciprocity and strong consistency in pairwise comparison matrix with fuzzy elements

The decision making problem considered in this paper is to rank n alternatives from the best to the worst, using the information given by the decision maker in the form of an \(n\times n\) pairwise comparison matrix. Here, we deal with pairwise comparison matrices with fuzzy elements. Fuzzy elements of the pairwise comparison matrix are applied whenever the decision maker is not sure about the value of his/her evaluation of the relative importance of elements in question. We investigate pairwise comparison matrices with elements from abelian linearly ordered group (alo-group) over a real interval. The concept of reciprocity and consistency of pairwise comparison matrices with fuzzy elements have been already studied in the literature. Here, we define stronger concepts, namely the strong reciprocity and strong consistency of pairwise comparison matrices with fuzzy intervals as the matrix elements (PCF matrices), derive the necessary and sufficient conditions for strong reciprocity and strong consistency and investigate their properties as well as some consequences to the problem of ranking the alternatives.     

基于基本回路修正的AHP一致性调整方法研究

为解决AHP一致性问题,提出一种基于基本回路修正的调整方法,能够同时解决数值不一致和逻辑不一致问题,同时保证对原始信息的修改量最小。数值不一致和逻辑不一致均由决策者的不准确判断引起,其中数值不一致可以通过降低一致性比率(CR)值进行改善,而逻辑不一致只有将判断矩阵中所有三阶回路去除才能得到解决。因此,通过对n阶判断矩阵进行基本矩阵分解,得到C³_n个3阶的基本矩阵,其中存在三阶回路的称为基本回路,从而将判断矩阵的一致性修正问题转化为基本回路的一致性修正问题。通过对基本回路的一致性比较,提出了两种确定最不一致元素的方法,即CR和最大法和优化法,并设计了优化模型对最不一致元素进行修正。最后,通过算例分析验证了本文方法的可行性,与已有方法的对比结论证明了本文方法更为有效。     

FDR control for pairwise comparisons of normal means based on goodness of fit test

This study is undertaken to apply a bootstrap method of controlling the false discovery rate (FDR) when performing pairwise comparisons of normal means. Due to the dependency of test statistics in pairwise comparisons, many conventional multiple testing procedures can’t be employed directly. Some modified procedures that control FDR with dependent test statistics are too conservative. In the paper, by bootstrap and goodness-of-fit methods, we produce independent p-values for pairwise comparisons. Based on these independent p-values, plenty of procedures can be used, and two typical FDR controlling procedures are applied here. An example is provided to illustrate the proposed approach. Extensive simulations show the satisfactory FDR control and power performance of our approach. In addition, the proposed approach can be easily extended to more than two normal, or non-normal, balance or unbalance cases.     

Convergence properties and practical estimation of the probability of rank reversal in pairwise comparisons for multi-criteria decision making problems

In this paper, we address the impact of uncertainty introduced when the experts complete pairwise comparison matrices, in the context of multi-criteria decision making. We first discuss how uncertainty can be quantified and modeled and then show how the probability of rank reversal scales with the number of experts. We consider the impact of various aspects which may affect the estimation of probability of rank reversal in the context of pairwise comparisons, such as the uncertainty level, alternative preference scales and different weight estimation methods. We also consider the case where the comparisons are carried out in a fuzzy manner. It is shown that in most circumstances, augmenting the size of the expert group beyond 15 produces a small change in the probability of rank reversal. We next address the issue of how this probability can be estimated in practice, from information gathered simply from the comparison matrices of a single expert group. We propose and validate a scheme which yields an estimate for the probability of rank reversal and test the applicability of this scheme under various conditions. The framework discussed in the paper can allow decision makers to correctly choose the number of experts participating in a pairwise comparison and obtain an estimate of the credibility of the outcome.     

A fuzzy ranking method with range reduction techniques

For ranking alternatives based on pairwise comparisons, current analytic hierarchy process (AHP) methods are difficult to use to generate useful information to assist decision makers in specifying their preferences. This study proposes a novel method incorporating fuzzy preferences and range reduction techniques. Modified from the concept of data envelopment analysis (DEA), the proposed approach is not only capable of treating incomplete preference matrices but also provides reasonable ranges to help decision makers to rank decision alternatives confidently.     

The nearest adjoining order method for pairwise comparisons in the form of difference of ranks

The problem of ranking of elements from some finite set on the basis of nearest adjoining order method for pairwise comparisons is investigated in this paper. It is assumed that in the set under consideration there exists a weak preference relation, which is to be identified (estimated) on the basis of pairwise comparisons in the form of difference of ranks. Moreover, the results of comparisons may be disturbed with random errors; the assumptions made about error distributions are not restrictive. The paper comprises: the problem formulation (definitions, assumptions, and optimisation problem, which provides the NAO solution) and the theoretical background – the form of distributions of random variables which make it possible to determine the properties of NAO solution, in particular, evaluation of the probability, that the NAO solution is equivalent to the errorless one. The approach presented in the paper can be extended to the case of more than one comparison for each pair of elements, i.e., completely formalised multi-experts ranking procedure. This revised version was published online in June 2006 with corrections to the Cover Date.     

A parametric GP model dealing with incomplete information for group decision-making

We consider a group decision-making problem where preferences given by the experts are articulated into the form of pairwise comparison matrices. In many cases, experts are not able to efficiently provide their preferences on some aspects of the problem because of a large number of alternatives, limited expertise related to some problem domain, unavailable data, etc., resulting in incomplete pairwise comparison matrices. Our goal is to develop a computational method to retrieve a group priority vector of the considered alternatives dealing with incomplete information. For that purpose, we have established an optimization problem in which a similarity function and a parametric compromise function are defined. Associated to this problem, a logarithmic goal programming formulation is considered to provide an effective procedure to compute the solution. Moreover, the parameters involved in the method have a clear meaning in the context of group problems.     

An intelligent decomposition of pairwise comparison matrices for large-scale decisions

A Pairwise Comparison Matrix (PCM) has been used to compute for relative priorities of elements and are integral components in widely applied decision making tools: the Analytic Hierarchy Process (AHP) and its generalized form, the Analytic Network Process (ANP). However, PCMs suffer from several issues limiting their applications to large-scale decision problems. These limitations can be attributed to the curse of dimensionality, that is, a large number of pairwise comparisons need to be elicited from a decision maker. This issue results to inconsistent preferences due to the limited cognitive powers of decision makers. To address these limitations, this research proposes a PCM decomposition methodology that reduces the elicited pairwise comparisons. A binary integer program is proposed to intelligently decompose a PCM into several smaller subsets using interdependence scores among elements. Since the subsets are disjoint, the most independent pivot element is identified to connect all subsets to derive the global weights of the elements from the original PCM. As a result, the number of pairwise comparison is reduced and consistency is of the comparisons is improved. The proposed decomposition methodology is applied to both AHP and ANP to demonstrate its advantages.     

Multicriteria order acceptance decision support in over-demanded job shops: A neural network approach

Order acceptance is an important issue in job shop production systems where demand exceeds capacity. In this paper, a neural network approach is developed for order acceptance decision support in job shops with machine and manpower capacity constraints. First, the order acceptance decision problem is formulated as a sequential multiple criteria decision problem. Then a neural network based preference model for order prioritization is described. The neural network based preference model is trained using preferential data derived from pairwise comparisons of a number of representative orders. An order acceptance decision rule based on the preference model is proposed. Finally, a numerical example is discussed to illustrate the use of the proposed neural network approach. The proposed neural network approach is shown to be a viable method for multicriteria order acceptance decision support in over-demanded job shops.     

一种基于决策矩阵的DST-AHP多属性决策方法

针对层次分析法决策时存在两两判断、一致性检验次数过多和判断矩阵残缺性等问题,本文提出了一种基于决策矩阵的DST-AHP多属性决策方法。该方法结合决策矩阵的特征值,构建DST-AHP方法层次结构模型和判断矩阵,并根据判断矩阵定义不同属性下各焦元的基本概率分配函数;然后利用Dempster合成法则对基本概率分配函数值进行合成,依据合成后值对方案进行排序。最后对AHP和DST-AHP两种方法进行比较分析,说明该方法的有效性。     

Interval estimation of priorities in the AHP

This paper extends and modifies the Analytic Hierarchy Process (AHP) and the Synthetic Hierarchy Method (SHM) of priority estimation to accommodate random data in the pairwise comparison matrices. It employs a Cauchy distribution to describe the pairwise comparison of alternatives in Saaty matrices, and shows how to modify these matrices in order to handle random data. The use of random data yields Saaty matrices that are not reciprocally symmetrical. Several variants of the AHP are then modified (i) to accommodate reciprocally asymmetric matrices, and (ii) to allow each priority estimate to be expressed on an interval of possible values, rather than as a single discrete point. The merits of interval estimation are illustrated by an example.     

Incomplete pairwise comparisons in the analytic hierarchy process

The Analytic Hierarchy Process is a decision-analysis tool which was developed by T.L. Saaty in the 1970s and which has been applied to many different decision problems in corporate, governmental and other institutional settings. The most successful applications have come about in group decisionmaking sessions, where the group structures the problem in a hierarchical framework and pairwise comparisons are elicited from the group for each level of the hierarchy. However, the number of pairwise comparison necessary in a real problem often becomes overwhelming. For example, with 9 alternatives and 5 criteria, the group must answer 190 questions. This paper explores various methods for reducing the complexity of the preference eliciting process. The theory of a method based upon the graph-theoretic structure of the pairwise comparison matrix and the gradient of the right Perron vector is developed, and simulations of a series of random matrices are used to illustrate the properties of this approach.     

Analysis of compatibility between interdependent matrices in ANP

Analytic network process (ANP) addresses multi-attribute decision-making where attributes exhibit dependencies. A principal characteristic of such problems is that pairwise comparisons are needed for attributes that have interdependencies. We propose that before such comparison matrices are used—in addition to a test that assesses the consistency of a pairwise comparison matrix—a test must also be conducted to assess ‘consistency’ across interdependent matrices. We call such a cross-matrix consistency test as a compatibility test. In this paper, we design a compatibility test for interdependent matrices between two clusters of attributes. We motivate our exposition by addressing compatibility in Sinarchy, a special form of ANP where interdependency exists between the last and next-to-last level. The developed compatibility test is applicable to any pair of interdependent matrices that are a part of an ANP.     

Matrix-free interior point method

In this paper we present a redesign of a linear algebra kernel of an interior point method to avoid the explicit use of problem matrices. The only access to the original problem data needed are the matrix-vector multiplications with the Hessian and Jacobian matrices. Such a redesign requires the use of suitably preconditioned iterative methods and imposes restrictions on the way the preconditioner is computed. A two-step approach is used to design a preconditioner. First, the Newton equation system is regularized to guarantee better numerical properties and then it is preconditioned. The preconditioner is implicit, that is, its computation requires only matrix-vector multiplications with the original problem data. The method is therefore well-suited to problems in which matrices are not explicitly available and/or are too large to be stored in computer memory. Numerical properties of the approach are studied including the analysis of the conditioning of the regularized system and that of the preconditioned regularized system. The method has been implemented and preliminary computational results for small problems limited to 1 million of variables and 10 million of nonzero elements demonstrate the feasibility of the approach.     

A posterior preference articulation approach to multiresponse surface optimization

In multiresponse surface optimization (MRSO), responses are often in conflict. To obtain a satisfactory compromise, the preference information of a decision maker (DM) on the tradeoffs among the responses should be incorporated into the problem. In most existing work, the DM expresses a subjective judgment on the responses through a preference parameter before the problem-solving process, after which a single solution is obtained. In this study, we propose a posterior preference articulation approach to MRSO. The approach initially finds a set of nondominated solutions without the DM’s preference information, and then allows the DM to select the best solution from among the nondominated solutions. An interactive selection method based on pairwise comparisons made by the DM is adopted in our method to facilitate the DM’s selection process. The proposed method does not require that the preference information be specified in advance. It is easy and effective in that a satisfactory compromise can be obtained through a series of pairwise comparisons, regardless of the type of the DM’s utility function.     

Probabilistic judgments specified partially in the analytic hierarchy process

The Analytic Hierarchy Process (AHP) is a decision-making tool which yields priorities for decision alternatives. This paper proposes a new approach to elicit and synthesize expert assessments for the group decision process in the AHP. These new elicitations are given as partial probabilistic specifications of the entries of pairwise comparisons matrices. For a particular entry of the matrix, the partial probabilistic elicitations could arise in the form of either probability assignments regarding the chance of that entry falling in specified intervals or selected quantiles for that entry. A new class of models is introduced to provide methods for processing this partial probabilistic information. One advantage of this approach is that it allows to generate as many pairwise comparison matrices of the decision alternatives as one desires. This, in turn, allows us to determine the statistical significance of the priorities of decision alternatives.     

ELECTRE: Robust ordinal regression for outranking methods

We present a new method, called ELECTRE^GKMS, which employs robust ordinal regression to construct a set of outranking models compatible with preference information. The preference information supplied by the decision maker (DM) is composed of pairwise comparisons stating the truth or falsity of the outranking relation for some real or fictitious reference alternatives. Moreover, the DM specifies some ranges of variation of comparison thresholds on considered pseudo-criteria. Using robust ordinal regression, the method builds a set of values of concordance indices, concordance thresholds, indifference, preference, and veto thresholds, for which all specified pairwise comparisons can be restored. Such sets are called compatible outranking models. Using these models, two outranking relations are defined, necessary and possible. Whether for an ordered pair of alternatives there is necessary or possible outranking depends on the truth of outranking relation for all or at least one compatible model, respectively. Distinguishing the most certain recommendation worked out by the necessary outranking, and a possible recommendation worked out by the possible outranking, ELECTRE^GKMS answers questions of robustness concern. The method is intended to be used interactively with incremental specification of pairwise comparisons, possibly with decreasing confidence levels. In this way, the necessary and possible outranking relations can be, respectively, enriched or impoverished with the growth of the number of pairwise comparisons. Furthermore, the method is able to identify troublesome pieces of preference information which are responsible for incompatibility. The necessary and possible outranking relations are to be exploited as usual outranking relations to work out recommendation in choice or ranking problems. The introduced approach is illustrated by a didactic example showing how ELECTRE^GKMS can support real-world decision problems.     

Hermitizable,isospectral complex matrices or differential operators

The main purpose of the paper is looking for a larger class of matrices which have real spectrum. The first well-known class having this property is the symmetric one, then is the Hermite one. This paper introduces a new class, called Hermitizable matrices. The closely related isospectral problem, not only for matrices but also for differential operators is also studied. The paper provides a way to describe the discrete spectrum, at least for tridiagonal matrices or one-dimensional differential operators. Especially, an unexpected result in the paper says that each Hermitizable matrix is isospectral to a birth–death type matrix (having positive sub-diagonal elements, in the irreducible case for instance). Besides, new efficient algorithms are proposed for computing the maximal eigenpairs of these class of matrices.     

Using tropical optimization techniques in bi-criteria decision problems

Computational Management Science - We consider decision problems of rating alternatives based on their pairwise comparisons according to two criteria. Given pairwise comparison matrices for each...