On Method for Uncertain Multiple Attribute Decision Making Problems with Uncertain Multiplicative Preference Information on Alternatives

The uncertain multiple attribute decision making (UMADM) problems are investigated, in which the information about attribute weights is known partly and the attribute values take the form of interval numbers, and the decision maker (DM) has uncertain multiplicative preference information on alternatives. We make the decision information uniform by using a transformation formula, and then establish an objective-programming model. The attribute weights can be determined by solving the developed model. The concept of interval positive ideal point of alternatives (IPIPA) is introduced, and an approach based on IPIPA and projection to ranking alternatives is proposed. The method can avoid comparing and ranking interval numbers, and can reflect both the objective information and the DMs subjective preferences.     

Newsvendor problem under complete uncertainty: a case of innovative products

The paper presents a new scenario-based decision rule for the classical version of the newsvendor problem (NP) under complete uncertainty (i.e. uncertainty with unknown probabilities). So far, NP has been analyzed under uncertainty with known probabilities or under uncertainty with partial information (probabilities known incompletely). The novel approach is designed for the sale of new, innovative products, where it is quite complicated to define probabilities or even probability-like quantities, because there are no data available for forecasting the upcoming demand via statistical analysis. The new procedure described in the contribution is based on a hybrid of Hurwicz and Bayes decision rules. It takes into account the decision maker’s attitude towards risk (measured by coefficients of optimism and pessimism) and the dispersion (asymmetry, range, frequency of extremes values) of payoffs connected with particular order quantities. It does not require any information about the probability distribution.

     

Towards a constructive approach to act-conditional subjective expected utility models

In structuring a decision problem under uncertainty, the uncertain environment may be affected by the choice of an act. In decision analysis, the decision maker provides subjective probabilities and utilities through separate elicitation processes, and then both components are combined together to give an index of his preference over decision alternatives. Based upon this conceptualisation of decision analysis, a constructive approach to act-conditional subjective expected utility theory is proposed. Two utility models have been addressed: the linear utility model and the weighted utility model.     

Constrained Markov decision processes with uncertain costs

We consider a finite state-action discounted constrained Markov decision process with uncertain running costs and known transition probabilities. We propose equivalent linear programming, second-order cone programming and semidefinite programming problems for the robust constrained Markov decision processes when the uncertain running cost vectors belong to polytopic, ellipsoidal, and semidefinite cone uncertainty sets, respectively. As an application, we study a variant of a machine replacement problem and perform numerical experiments on randomly generated instances of various sizes.     

部分权重信息下对方案有互补偏好的多属性决策法

研究了只有部分权重信息且对方案的偏好信息以模糊互补判断矩阵形式给出的多属性决策问题.首先,基于模糊互补判断矩阵的主观偏好信息,利用转换函数将客观决策信息一致化,建立一个目标规划模型,通过求解该模型得到属性权重,从而利用加性加权法获得各方案的综合属性值,并以此对方案进行排序或择优.提出了一种基于目标规划的多属性决策方法.该方法具有操作简便和易于上机实现的特点.最后,通过实例说明模型及方法的可行性和有效性.     

A framework for sensitivity analysis of decision trees

In the paper, we consider sequential decision problems with uncertainty, represented as decision trees. Sensitivity analysis is always a crucial element of decision making and in decision trees it often focuses on probabilities. In the stochastic model considered, the user often has only limited information about the true values of probabilities. We develop a framework for performing sensitivity analysis of optimal strategies accounting for this distributional uncertainty. We design this robust optimization approach in an intuitive and not overly technical way, to make it simple to apply in daily managerial practice. The proposed framework allows for (1) analysis of the stability of the expected-value-maximizing strategy and (2) identification of strategies which are robust with respect to pessimistic/optimistic/mode-favoring perturbations of probabilities. We verify the properties of our approach in two cases: (a) probabilities in a tree are the primitives of the model and can be modified independently; (b) probabilities in a tree reflect some underlying, structural probabilities, and are interrelated. We provide a free software tool implementing the methods described.

     

Multiple criteria group decision-making with generalized interval-valued fuzzy numbers based on signed distances and incomplete weights

Decision-making information provided by decision makers is often imprecise or uncertain, due to lack of data, time pressure, or the decision makers’ limited attention and information-processing capabilities. Interval-valued fuzzy sets are associated with greater imprecision and more ambiguity than are ordinary fuzzy sets. For these reasons, this paper presents a signed distance-based method for handling fuzzy multiple-criteria group decision-making problems in which individual assessments are provided as generalized interval-valued trapezoidal fuzzy numbers, and the information about criterion weights are not precisely but partially known. First, concerning the relative importance of decision makers and the group consensus of fuzzy opinions, all individual decision opinions were aggregated into group opinions using a hybrid average with weighted averaging and signed distance-based ordered weighted averaging operations. Next, considering a decision situation with incomplete weight information of criteria, an integrated programming model was developed to estimate criterion weights and to order the priorities of various alternatives based on signed distances. In addition, several deviation variables were introduced to mitigate the effect of inconsistent evaluations on the importance of criteria. Finally, the feasibility of the proposed method is illustrated by a numerical example of a multi-criteria supplier selection problem. Furthermore, a comparative analysis with other methods was conducted to validate the effectiveness and applicability of the proposed methodology.     

Warp effects on calculating interval probabilities

In real-life decision analysis, the probabilities and utilities of consequences are in general vague and imprecise. One way to model imprecise probabilities is to represent a probability with the interval between the lowest possible and the highest possible probability, respectively. However, there are disadvantages with this approach; one being that when an event has several possible outcomes, the distributions of belief in the different probabilities are heavily concentrated toward their centres of mass, meaning that much of the information of the original intervals are lost. Representing an imprecise probability with the distribution’s centre of mass therefore in practice gives much the same result as using an interval, but a single number instead of an interval is computationally easier and avoids problems such as overlapping intervals. We demonstrate why second-order calculations add information when handling imprecise representations, as is the case of decision trees or probabilistic networks. We suggest a measure of belief density for such intervals. We also discuss properties applicable to general distributions. The results herein apply also to approaches which do not explicitly deal with second-order distributions, instead using only first-order concepts such as upper and lower bounds.     

Possible new applications of the interactive programming based on aspiration levels—case of pure and mixed strategies

The interactive programming (IP) using aspiration levels is a well-known method applied to multi-criteria decision making under certainty (M-DMC). However, some essential analogies between M-DMC and scenario-based one-criterion decision making under uncertainty (1-DMU) have been recently revealed in the literature. These observations give the opportunity to adjust the IP to a totaly new issue. The goal of the paper is to create two novel procedures for uncertain problems on the basis of the IP ideas: the first one for pure strategy searching and the second for mixed strategy searching. In many ways, they allow a better consideration of the decision maker's preferences than classical decision rules. One of their significant advantages consists in analyzing particular scenarios sequentially. Another strong point is that the new procedures can be used by any kind of decision makers (optimists, moderate, pessimists). The new approaches may be helpful when solving problems under uncertainty with partially known probabilities. Both methods are illustrated in the paper on the basis of two fictitious decision problems concerning the choice of an optimal location and the optimization of the stock portfolio structure.

     

基于主客观权重集成的电子商务网站评价方法

研究了不确定决策环境下企业电子商务网站评价问题。利用专家给出的区间互补判断矩阵,获得属性的主观权重;定义了区间数的平均差,提出了一种属性客观权重确定方法——平均差极大化方法;通过加权系数把主观权重与客观权重线性集成,使得到的综合权重同时反映主观和客观程度,并给出了一种基于投影模型的决策方案排序方法。最后通过算例说明该方法的可行性和有效性。     

Modifications of the Hurwicz’s decision rule

The Hurwicz’s criterion is one of the classical decision rules applied in decision making under uncertainty as a tool enabling to find an optimal pure strategy both for interval and scenarios uncertainty. The interval uncertainty occurs when the decision maker knows the range of payoffs for each alternative and all values belonging to this interval are theoretically probable (the distribution of payoffs is continuous). The scenarios uncertainty takes place when the result of a decision depends on the state of nature that will finally occur and the number of possible states of nature is known and limited (the distribution of payoffs is discrete). In some specific cases the use of the Hurwicz’s criterion in the scenarios uncertainty may lead to quite illogical and unexpected results. Therefore, the author presents two new procedures combining the Hurwicz’s pessimism-optimism index with the Laplace’s approach and using an additional parameter allowing to set an appropriate width for the ranges of relatively good and bad payoffs related to a given decision. The author demonstrates both methods on the basis of an example concerning the choice of an investment project. The methods described may be used in each decision making process within which each alternative (decision, strategy) is characterized by only one criterion (or one synthetic measure).     

Maximising entropy on the nonparametric predictive inference model for multinomial data

The combination of mathematical models and uncertainty measures can be applied in the area of data mining for diverse objectives with as final aim to support decision making. The maximum entropy function is an excellent measure of uncertainty when the information is represented by a mathematical model based on imprecise probabilities. In this paper, we present algorithms to obtain the maximum entropy value when the information available is represented by a new model based on imprecise probabilities: the nonparametric predictive inference model for multinomial data (NPI-M), which represents a type of entropy-linear program. To reduce the complexity of the model, we prove that the NPI-M lower and upper probabilities for any general event can be expressed as a combination of the lower and upper probabilities for the singleton events, and that this model can not be associated with a closed polyhedral set of probabilities. An algorithm to obtain the maximum entropy probability distribution on the set associated with NPI-M is presented. We also consider a model which uses the closed and convex set of probability distributions generated by the NPI-M singleton probabilities, a closed polyhedral set. We call this model A-NPI-M. A-NPI-M can be seen as an approximation of NPI-M, this approximation being simpler to use because it is not necessary to consider the set of constraints associated with the exact model.     

Computing upper and lower bounds in interval decision trees

This article presents algorithms for computing optima in decision trees with imprecise probabilities and utilities. In tree models involving uncertainty expressed as intervals and/or relations, it is necessary for the evaluation to compute the upper and lower bounds of the expected values. Already in its simplest form, computing a maximum of expectancies leads to quadratic programming (QP) problems. Unfortunately, standard optimization methods based on QP (and BLP – bilinear programming) are too slow for the evaluation of decision trees in computer tools with interactive response times. Needless to say, the problems with computational complexity are even more emphasized in multi-linear programming (MLP) problems arising from multi-level decision trees. Since standard techniques are not particularly useful for these purposes, other, non-standard algorithms must be used. The algorithms presented here enable user interaction in decision tools and are equally applicable to all multi-linear programming problems sharing the same structure as a decision tree.     

基于二元联系数距离的不确定语言多属性决策模型

研究了属性权重范围已知,方案主观偏好值为语言变量,决策信息为不确定语言决策矩阵的多属性决策问题.在给出不确定语言变量转换为二元联系数的公式以及二元联系数距离公式的基础上,将方案主观偏好语言评价值转换为二元联系数,将不确定语言决策矩阵转换为二元联系数决策矩阵,从而得到方案的二元联系数综合属性值,通过最小化方案的二元联系数综合属性值和主观偏好值之间距离,建立多目标优化模型,并将其转换为一个单目标规划模型计算出属性权重.然后,通过对方案的二元联系数综合属性值进行不确定性分析,得到各方案的排序总数,利用排序总数对方案进行排序择优.应用实例表明该决策方法可行有效.     

Worst-case robust decisions for multi-period mean–variance portfolio optimization

In this paper, we extend the multi-period mean–variance optimization framework to worst-case design with multiple rival return and risk scenarios. Our approach involves a min–max algorithm and a multi-period mean–variance optimization framework for the stochastic aspects of the scenario tree. Multi-period portfolio optimization entails the construction of a scenario tree representing a discretised estimate of uncertainties and associated probabilities in future stages. The expected value of the portfolio return is maximized simultaneously with the minimization of its variance. There are two sources of further uncertainty that might require a strengthening of the robustness of the decision. The first is that some rival uncertainty scenarios may be too critical to consider in terms of probabilities. The second is that the return variance estimate is usually inaccurate and there are different rival estimates, or scenarios. In either case, the best decision has the additional property that, in terms of risk and return, performance is guaranteed in view of all the rival scenarios. The ex-ante performance of min–max models is tested using historical data and backtesting results are presented.     

Approaches to multistage one-shot decision making

In this research, multistage one-shot decision making under uncertainty is studied. In such a decision problem, a decision maker has one and only one chance to make a decision at each stage with possibilistic information. Based on the one-shot decision theory, approaches to multistage one-shot decision making are proposed. In the proposed approach, a decision maker chooses one state amongst all the states according to his/her attitude about satisfaction and possibility at each stage. The payoff at each stage is associated with the focus points at the succeeding stages. Based on the selected states (focus points), the sequence of optimal decisions is determined by dynamic programming. The proposed method is a fundamental alternative for multistage decision making under uncertainty because it is scenario-based instead of lottery-based as in the other existing methods. The one-shot optimal stopping problem is analyzed where a decision maker has only one chance to determine stopping or continuing at each stage. The theoretical results have been obtained.     

A goal programming model for incomplete interval multiplicative preference relations and its application in group decision-making

In decision making problems, there may be the cases where the decision makers express their judgements by using preference relations with incomplete information. Then one of the key issues is how to estimate the missing preference values. In this paper, we introduce an incomplete interval multiplicative preference relation and give the definitions of consistent and acceptable incomplete ones, respectively. Based on the consistency property of interval multiplicative preference relations, a goal programming model is proposed to complement the acceptable incomplete one. A new algorithm of obtaining the priority vector from incomplete interval multiplicative preference relations is given. The goal programming model is further applied to group decision-making (GDM) where the experts evaluate their preferences as acceptable incomplete interval multiplicative preference relations. An interval weighted geometric averaging (IWGA) operator is proposed to aggregate individual preference relations into a social one. Furthermore, the social interval multiplicative preference relation owns acceptable consistency when every individual one is acceptably consistent. Two numerical examples are carried out to show the efficiency of the proposed goal programming model and the algorithms.     

Probability maximization models for portfolio selection under ambiguity

This paper considers several probability maximization models for multi-scenario portfolio selection problems in the case that future returns in possible scenarios are multi-dimensional random variables. In order to consider occurrence probabilities and decision makers’ predictions with respect to all scenarios, a portfolio selection problem setting a weight with flexibility to each scenario is proposed. Furthermore, by introducing aspiration levels to occurrence probabilities or future target profit and maximizing the minimum aspiration level, a robust portfolio selection problem is considered. Since these problems are formulated as stochastic programming problems due to the inclusion of random variables, they are transformed into deterministic equivalent problems introducing chance constraints based on the stochastic programming approach. Then, using a relation between the variance and absolute deviation of random variables, our proposed models are transformed into linear programming problems and efficient solution methods are developed to obtain the global optimal solution. Furthermore, a numerical example of a portfolio selection problem is provided to compare our proposed models with the basic model.     

Heterogeneous uncertainties in cholesterol management

Physicians use clinical guidelines to inform judgment about therapy. Clinical guidelines do not address three important uncertainties: (1) uncertain relevance of tested populations to the individual patient, (2) the patient’s uncertain preferences among possible outcomes, and (3) uncertain subjective and financial costs of intervention. Unreliable probabilistic information is available for some of these uncertainties; no probabilities are available for others. The uncertainties are in the values of parameters and in the shapes of functions. We explore the usefulness of info-gap decision theory in patient-physician decision making in managing cholesterol level using clinical guidelines. Info-gap models of uncertainty provide versatile tools for quantifying diverse uncertainties. Info-gap theory provides two decision functions for evaluating alternative therapies. The robustness function assesses the confidence—in light of uncertainties—in attaining acceptable outcomes. The opportuneness function assesses the potential for better-than-anticipated outcomes. Both functions assist in forming preferences among alternatives. Hypothetical case studies demonstrate that decisions using the guidelines and based on best estimates of the expected utility are sometimes, but not always, consistent with robustness and opportuneness analyses. The info-gap analysis provides guidance when judgment suggests that a deviation from the guidelines would be productive. Finally, analysis of uncertainty can help resolve ambiguous situations.