Robust optimization analysis for multiple attribute decision making problems with imprecise information

This paper considers ranking decision alternatives under multiple attributes with imprecise information on both attribute weights and alternative ratings. It is demonstrated that regret results from the decision maker??s inadequate knowledge about the true scenario to occur. Potential optimality analysis is a traditional method to evaluate alternatives with imprecise information. The essence of this approach is to identify any alternative that outperforms the others in its best-case scenario. Our analysis shows that potential optimality analysis is optimistic in nature and may lead to a significant loss if an unfavorable scenario occurs. We suggest a robust optimization analysis approach that ranks alternatives in terms of their worst-case absolute or relative regret. A robust optimal alternative performs reasonably well in all scenarios and is shown to be desirable for a risk-concerned decision maker. Linear programming models are developed to check robust optimality.     

Ranking residential properties by a multicriteria single price model

This study describes an application of the multicriteria single price model (Ballestero) to the ranking of alternatives. By a generalization of the original model, the equilibrium set of alternatives can be characterized from the viewpoints, respectively, of the demander and the supplier, and from that the efficiency index can be calculated. We demonstrate how, in a state of equilibrium, the two viewpoints result inevitably in inverse orders of ranking. In contrast with other proposals for full ranking of alternatives, the method used in the present study (i) assumes a moderate attitude on the part of the decision maker towards risk, with a robust axiomatic basis; (ii) assigns weights to the criteria independently of which alternative is being evaluated and the attitude (optimistic or pessimistic) of the decision maker; (iii) produces a cardinal hierarchy of the alternatives and not just an ordinal one. The model is illustrated by a sample of residential properties in the city of Valencia, Spain.     

An intuitionistic fuzzy programming method for group decision making with interval-valued fuzzy preference relations

The paper develops a new intuitionistic fuzzy (IF) programming method to solve group decision making (GDM) problems with interval-valued fuzzy preference relations (IVFPRs). An IF programming problem is formulated to derive the priority weights of alternatives in the context of additive consistent IVFPR. In this problem, the additive consistent conditions are viewed as the IF constraints. Considering decision makers’ (DMs’) risk attitudes, three approaches, including the optimistic, pessimistic and neutral approaches, are proposed to solve the constructed IF programming problem. Subsequently, a new consensus index is defined to measure the similarity between DMs according to their individual IVFPRs. Thereby, DMs’ weights are objectively determined using the consensus index. Combining DMs’ weights with the IF program, a corresponding IF programming method is proposed for GDM with IVFPRs. An example of E-Commerce platform selection is analyzed to illustrate the feasibility and effectiveness of the proposed method. Finally, the IF programming method is further extended to the multiplicative consistent IVFPR.     

Weighted Overlap Dominance – A procedure for interactive selection on multidimensional interval data

We present an outranking procedure that supports selection of alternatives represented by multiple attributes with interval valued data. The procedure is interactive in the sense that the decision maker directs the search for preferred alternatives by providing weights of the different attributes as well as parameters related to risk attitude and weighted dominance. The outranking relation builds on pairwise comparisons between optimistic and pessimistic weighted values as well as weighted dominance relations supported by volume based measures. The suggested procedure is referred to as the Weighted Overlap Dominance procedure (WOD).     

基于累积前景理论和VIKOR的毕达哥拉斯犹豫模糊风险型多属性决策方法

针对属性权重未知,且属性值为毕达哥拉斯犹豫模糊数(PHFN)的风险型多属性决策问题,考虑到决策者的有限理性行为,提出基于累积前景理论(CPT)和多准则妥协优化解(VIKOR)的决策方法。首先,定义PHFN的分散率,并构建优化模型确定属性权重。其次,将CPT融入PHFN环境,定义PHFN的价值函数,并结合决策权重函数计算方案在各属性下的综合前景值。进一步,构建综合前景值矩阵,在此基础上运用VIKOR法确定方案排序。最后,通过风险投资项目选择的应用案例说明所提方法是可行、有效的。     

A partial cooperation model for non-unique linear two-level decision problems

This paper examines a linear static Stackelberg game where the follower's optimal reaction is not unique. Traditionally, the problem has been approached using either an optimistic or a pessimistic framework, respectively, representing the two extreme situations of full cooperation and zero cooperation from the follower. However, partial cooperation from the follower is a viable option. For partial cooperation, the leader's optimal strategy may be neither optimistic nor pessimistic. Introducing a cooperation index to describe the degree of follower cooperation, we first formulate a partial cooperation model for the leader. The two-level problem is then reformulated into a single-level model. It is shown that the optimistic and pessimistic situations are special cases of the general model, and that the leader's optimal choice may be an intermediate solution.     

Classifying efficient alternatives in SMAA using cross confidence factors

Stochastic multicriteria acceptability analysis (SMAA) is a family of methods for aiding multicriteria group decision making. These methods are based on exploring the weight space in order to describe the preferences that make each alternative the most preferred one. The main results of the analysis are rank acceptability indices, central weight vectors and confidence factors for different alternatives. The rank acceptability indices describe the variety of different preferences resulting in a certain rank for an alternative; the central weight vectors represent the typical preferences favouring each alternative; and the confidence factors measure whether the criteria data are sufficiently accurate for making an informed decision.In some cases, when the problem involves a large number of efficient alternatives, the analysis may fail to discriminate between them. This situation is revealed by low confidence factors. In this paper we develop cross confidence factors, which are based on computing confidence factors for alternatives using each other’s central weight vectors. The cross confidence factors can be used for classifying efficient alternatives into sets of similar and competing alternatives. These sets are related to the concept of reference sets in Data Envelopment Analysis (DEA), but generalized for stochastic models. Forming these sets is useful when trying to identify one or more most preferred alternatives, or suitable compromise alternatives. The reference sets can also be used for evaluating whether criteria need to be measured more accurately, and at which alternatives the measurements should be focused. This may cause considerable savings in measurement costs. We demonstrate the use of the cross confidence factors and reference sets using a real-life example.     

Low Tucker rank tensor completion using a symmetric block coordinate descent method

Low Tucker rank tensor completion has wide applications in science and engineering. Many existing approaches dealt with the Tucker rank by unfolding matrix rank. However, unfolding a tensor to a matrix would destroy the data's original multi-way structure, resulting in vital information loss and degraded performance. In this article, we establish a relationship between the Tucker ranks and the ranks of the factor matrices in Tucker decomposition. Then, we reformulate the low Tucker rank tensor completion problem as a multilinear low rank matrix completion problem. For the reformulated problem, a symmetric block coordinate descent method is customized. For each matrix rank minimization subproblem, the classical truncated nuclear norm minimization is adopted. Furthermore, temporal characteristics in image and video data are introduced to such a model, which benefits the performance of the method. Numerical simulations illustrate the efficiency of our proposed models and methods.     

Interactive outranking approaches for multicriteria decision-making problems with imprecise information

PROMETHEE is a powerful method, which can solve many multiple criteria decision making (MCDM) problems. It involves sophisticated preference modelling techniques but requires too much a priori precise information about parameter values (such as criterion weights and thresholds). In this paper, we consider a MCDM problem where alternatives are evaluated on several conflicting criteria, and the criterion weights and/or thresholds are imprecise or unknown to the decision maker (DM). We build robust outranking relations among the alternatives in order to help the DM to rank the alternatives and select the best alternative. We propose interactive approaches based on PROMETHEE method. We develop a decision aid tool called INTOUR, which implements the developed approaches.     

Super-efficiency in DEA by effectiveness of each unit in society

One of the most important topics in management science is determining the efficiency of Decision Making Units (DMUs). The Data Envelopment Analysis (DEA) technique is employed for this purpose. In many DEA models, the best performance of a DMU is indicated by an efficiency score of one. There is often more than one DMU with this efficiency score. To rank and compare efficient units, many methods have been introduced under the name of super-efficiency methods. Among these methods, one can mention Andersen and Petersen’s (1993) [1] super-efficiency model, and the slack-based measure introduced by Tone (2002) [4]. Each of the methods proposed for ranking efficient DMUs has its own advantages and shortcomings. In this paper, we present a super-efficiency method by which units that are more effective and useful in society have better ranks. In fact, in order to determine super-efficiency by this method, the effectiveness of each unit in society is considered rather than the cross-comparison of the units. To do so, we divide the inputs and outputs into two groups, desirable and undesirable, at the discretion of the manager, and assign weights to each input and output. Then we determine the rank of each DMU according to the weights and the desirability of inputs and outputs.     

语言多属性决策的一种组合方法

研究了属性权重完全未知,方案属性值和偏好值均为语言变量的多属性决策问题.首先,通过分析相关文献中利用方案属性值与偏好值之间的偏差得到属性权重的不合理性,在最小化方案综合属性值与偏好值的偏差的基础上,建立了一个求解属性权重的规划模型.其次,在各方案的属性值与属性正理想点的偏差最小的基础上,又建立一个求解属性权重的规划模型.第三,在综合考虑各属性下所有决策方案总的组合偏差之和最小的基础上,将上述两个规划模型相结合,得到了一个反映出决策者对两种不同信息的偏好程度的求解属性权重的规划模型,得到了语言多属性决策的一种组合方法.最后,通过实例说明方法的可行性与有效性.     

基于新精确函数的区间直觉模糊多属性决策方法

基于区间直觉模糊数隶属度和非隶属度构成的二维几何图形特征给出区间直觉模糊数精确函数的新定义,并将其作为区间直觉模糊数的排序指标,区间直觉模糊数的精确函数值越大,则区间直觉模糊数就越大,进而提出一种权重信息不完全确定的区间直觉模糊多属性决策方法.通过算例分析说明所提出排序指标的有效性和决策方法的可行性.     

权重信息不完全的多属性决策的灰色关联分析法

针对属性权重信息不完全且属性值确定的多属性决策问题,提出了一种灰色关联分析的决策方法.该方法依据一般的灰色关联分析方法的基本思路,给出了解决属性权重信息不完全的多属性决策问题的计算步骤,其核心是通过构建并求解一个单目标最优化模型,得到每个方案与正、负理想方案的关联度,进而计算出每个方案与正理想方案的相对关联度,即可得到所有方案的排序结果.最后给出了一个数值例子,结果表明方法简单,有效和易于计算.     

基于乐观抱怨值和悲观抱怨值的合作博弈最优妥协值的求解模型

基于乐观抱怨值和悲观抱怨值,通过建立二次规划模型求解(Hou,et al.,2018)定义的平衡博弈的最优妥协值,二次规划模型及求解方法比(Hou,et al.,2018)提出的字典序方法简单易操作.此外,文章进一步给出了同时满足个体合理性和群体有效性的乐观最优妥协值的求解算法.最后,通过数值实例说明文章建立的模型和方...     

一种PROMETHEE Ⅱ权重的敏感性分析方法

以往MADM的敏感性分析主要研究的是使方案集排序稳定的参数区间。本文针对PROMETHEEⅡ方法的权重建立一种新的敏感性分析数学模型，利用经典的线性规划方法，求解使得某方案排序第一且变化最小的权重值，回答了权重超出稳定区间后排序改变方向的问题。在实际应用中，有利于帮助决策者及时调整权重，得到合理结果。     

基于相对熵的区间Pythagorean模糊多属性AQM决策方法及其应用

针对决策信息为区间Pythagorean模糊数,属性权重不完全确定的多属性决策问题,提出了一种基于相对熵的AQM决策方法。首先,提出区间Pythagorean模糊数的相对熵,计算了各方案与区间Pythagorean模糊正理想方案和负理想方案间的相对熵,据此构建了基于方案相对满意度最大的非线性规划属性权重确定模型;其次,针对每个属性,利用新的区间Pythagorean模糊数得分函数计算方案的0-1优先关系矩阵,依据AQM方法对所有0-1优先关系矩阵进行融合得到合成0-1优先关系矩阵,并确定了方案的综合度,由此获得方案的排序。最后,以软件开发项目的选取为实例说明了该方法的可行性和有效性。     

区间AHP权重计算的目标规划法

本文对区间 AHP的权重计算问题进行了研究 ,给出了几种新的权重计算方法 .每种方法求解一个线性目标规划问题得到各方案的区间权重 .文章最后给出了一个算例 .     

A multiple criteria ranking method based on game cross-evaluation approach

The application of Data Envelopment Analysis (DEA) as an alternative multiple criteria decision making (MCDM) tool has been gaining more attentions in the literatures. Doyle (Organ. Behav. Hum. Decis. Process. 62(1):87?C100, 1995) presents a method of multi-attribute choice based on an application of DEA. In the first part of his method, the straightforward DEA is considered as an idealized process of self-evaluation in which each alternative weighs the attributes in order to maximize its own score (or desirability) relative to the other alternatives. Then, in the second step, each alternative applies its own DEA-derived best weights to each of the other alternatives (i.e., cross-evaluation), then the average of the cross-evaluations that get placed on an alternative is taken as an index of its overall score. In some cases of multiple criteria decision making, direct or indirect competitions exist among the alternatives, while the factor of competition is usually ignored in most of MCDM settings. This paper proposes an approach to evaluate and rank alternatives in MCDM via an extension of DEA method, namely DEA game cross-efficiency model in Liang, Wu, Cook and Zhu (Oper. Res. 56(5):1278?C1288, 2008b), in which each alternative is viewed as a player who seeks to maximize its own score (or desirability), under the condition that the cross-evaluation scores of each of other alternatives does not deteriorate. The game cross-evaluation score is obtained when the alternative??s own maximized scores are averaged. The obtained game cross-evaluation scores are unique and constitute a Nash equilibrium point. Therefore, the results and rankings based upon game cross-evaluation score analysis are more reliable and will benefit the decision makers.     

Dominance,potential optimality and alternative ranking in imprecise multi-attribute decision making

In this paper, we introduce a methodology based on an additive multiattribute utility function that does not call for precise estimations of the inputs, such as utilities, attribute weights and performances of decision alternatives. The information about such inputs is assumed to be in the form of ranges, which constitute model constraints and give rise to nonlinear programming problems. This has significant drawbacks for outputting the sets of non-dominated and potentially optimal alternatives for such problems, and we, therefore, propose their transformation into equivalent linear programming problems. The set of non-dominated and potentially optimal alternatives is a non-ranked set and can be very large, which makes the choice of the most preferred alternative very difficult. The above problem is solved by proposing several methods for alternative ranking. An application to the disposal of surplus weapons-grade plutonium is considered, showing the advantages of this approach.