Interactive weight assessment in multiple attribute decision making

A weight assessing method is given for solving a multiple attribute decision problem involving one decision maker. The method provides significant freedom to the decision maker who is asked only to specify certain groups of attributes and the corresponding joint weights. The method then provides a sophisticated interaction between various levels of the attributes involved. Furthermore, if the decision maker wishes to give additional information of the above-mentioned kind, he establishes an interaction on the level of the solution process. This can compensate for the inherent limitations of any method based on scalar utility functions by allowing a certain intransitivity and incomparability of preferences, which are natural in multiple attribute situations.     

Cutting plane method for multiple objective stochastic integer linear programming

This paper grapples with the problem of incorporating integer variables in the constraints of a multiple objective stochastic linear program (MOSLP). After representing uncertain aspirations of the decision maker by converting the original problem into a deterministic multiple objective integer linear program (MOILP), a cutting plane technique may be used to compute all the efficient solutions of the last model leaving the decision maker to choose a solution according to his preferences. A numerical example is also included for illustration.     

Improving the computational efficiency in a global formulation (GLIDE) for interactive multiobjective optimization

In this paper, we present a new general formulation for multiobjective optimization that can accommodate several interactive methods of different types (regarding various types of preference information required from the decision maker). This formulation provides a comfortable implementation framework for a general interactive system and allows the decision maker to conveniently apply several interactive methods in one solution process. In other words, the decision maker can at each iteration of the solution process choose how to give preference information to direct the interactive solution process, and the formulation enables changing the type of preferences, that is, the method used, whenever desired. The first general formulation, GLIDE, included eight interactive methods utilizing four types of preferences. Here we present an improved version where we pay special attention to the computational efficiency (especially significant for large and complex problems), by eliminating some constraints and parameters of the original formulation. To be more specific, we propose two new formulations, depending on whether the multiobjective optimization problem to be considered is differentiable or not. Some computational tests are reported showing improvements in all cases. The generality of the new improved formulations is supported by the fact that they can accommodate six interactive methods more, that is, a total of fourteen interactive methods, just by adjusting parameter values.     

NAUTILUS method: An interactive technique in multiobjective optimization based on the nadir point

Most interactive methods developed for solving multiobjective optimization problems sequentially generate Pareto optimal or nondominated vectors and the decision maker must always allow impairment in at least one objective function to get a new solution. The NAUTILUS method proposed is based on the assumptions that past experiences affect decision makers’ hopes and that people do not react symmetrically to gains and losses. Therefore, some decision makers may prefer to start from the worst possible objective values and to improve every objective step by step according to their preferences. In NAUTILUS, starting from the nadir point, a solution is obtained at each iteration which dominates the previous one. Although only the last solution will be Pareto optimal, the decision maker never looses sight of the Pareto optimal set, and the search is oriented so that (s)he progressively focusses on the preferred part of the Pareto optimal set. Each new solution is obtained by minimizing an achievement scalarizing function including preferences about desired improvements in objective function values. NAUTILUS is specially suitable for avoiding undesired anchoring effects, for example in negotiation support problems, or just as a means of finding an initial Pareto optimal solution for any interactive procedure. An illustrative example demonstrates how this new method iterates.     

Monte Carlo simulation techniques for group decision making with incomplete information

In this paper we deal with group decision-making problems where several decision makers elicit their own preferences separately. The decision makers’ preferences are quantified using a decision support system, which admits incomplete information concerning the decision makers’ responses to the questions they are asked. Consequently, each decision maker proposes classes of utility functions and attribute weight intervals for the different attributes. We introduce an approach based on Monte Carlo simulation techniques for aggregating decision maker preferences that could be the starting point for a negotiation process, if necessary. The negotiation process would basically involve the decision maker tightening the imprecise component utilities and weights to output more meaningful results and achieve a consensus alternative. We focus on how attribute weights and the component utilities associated with a consequence are randomly generated in the aggregation process taking into account the decision-makers’ preferences, i.e., their respective attribute weight intervals and classes of utility functions. Finally, an application to the evaluation of intervention strategies for restoring a radionuclide contaminated lake illustrates the usefulness and flexibility of this iterative process.     

An extension of TOPSIS for group decision making

An extension of TOPSIS (technique for order performance by similarity to ideal solution), a multi-attribute decision making (MADM) technique, to a group decision environment is investigated. TOPSIS is a practical and useful technique for ranking and selection of a number of externally determined alternatives through distance measures. To get a broad view of the techniques used, we provide a few options for the operations, such as normalization, distance measures and mean operators, at each of the corresponding steps of TOPSIS. In addition, the preferences of more than one decision maker are internally aggregated into the TOPSIS procedure. Unlike in previous developments, our group preferences are aggregated within the procedure. The proposed model is indeed a unified process and it will be readily applicable to many real-world decision making situations without increasing the computational burden. In the final part, the effects of external aggregation and internal aggregation of group preferences for TOPSIS with different computational combinations are compared using examples. The results have demonstrated our model to be both robust and efficient.     

Restricting weights in supplier selection decisions in the presence of dual-role factors

One of the uses of data envelopment analysis (DEA) is supplier selection. Weight restrictions allow for the integration of managerial preferences in terms of relative importance levels of various inputs and outputs. As well, in some situations there is a strong argument for permitting certain factors to simultaneously play the role of both inputs and outputs. The objective of this paper is to propose a method for selecting the best suppliers in the presence of weight restrictions and dual-role factors. This paper depicts the supplier selection process through a DEA model, while allowing for the incorporation of decision maker’s preferences and considers multiple factors which simultaneously play both input and output roles. The proposed model does not demand exact weights from the decision maker. This paper presents a robust model to solve the multiple-criteria problem. A numerical example demonstrates the application of the proposed method.     

Set choice problems with incomplete information about the preferences of the decision maker

We consider the problem of selecting a predetermined number of objects from a given finite set. It is assumed that the preferences of the decision maker on this set are only partially known. Our solution approach is based on the notions of optimal and non-dominated subsets. The properties of such subsets and the objects they contain are investigated. The implementation of the developed approach is discussed and illustrated by various examples.     

The Use of Multi-Dimensional Scaling in Policy Selection

The selection of the best from a set of available policies with multi-dimensional consequences is a basic problem in decision analysis. In this paper the technique of multi-dimensional scaling is used to define a preference structure from attitude data collected from the decision maker. This data is based on a comparison of each pair of policies. Using the concept of the ideal solution, the absolute preferences for the available policies can be defined, hence allowing the policies to be ranked from most to least desirable.     

Duality in robust optimization: Primal worst equals dual best

We study the dual problems associated with the robust counterparts of uncertain convex programs. We show that while the primal robust problem corresponds to a decision maker operating under the worst possible data, the dual problem corresponds to a decision maker operating under the best possible data.     

基于GMCR-NPAWLAK混合模型的冲突分析研究

冲突分析图模型中,决策者的态度只有肯定和否定两种,实际问题中往往不止两种;新PAWLAK冲突模型(NPAWLAK模型)将冲突系统中决策者的三种态度扩展到决策争端的三种程度,符合实际情况,因而研究冲突系统中决策者的偏好排序和全局可行方案对决策者的策略选择具有重要意义。本文在NPAWLAK模型的基础上,引入冲突分析图模型理论(GMCR),提出GMCR-NPAWLAK冲突分析混合模型。该混合模型首先拓展和改进的策略优先排序法,实现了冲突系统中各决策者的客观偏好排序;同时,模型给出了全局可行方案的算法,该算法依据决策者的偏好排序分析结果找出系统的全局可行方案。最后,本文以某企业劳资关系的NPAWLAK冲突为例,对冲突系统进行建模和偏好分析,得到了冲突各方的偏好序列和全局可行方案,同时验证了混合模型的有效性。     

Capacitated transportation problem with bounds on RIM conditions

Motivated by dead-mileage problem assessed in terms of running empty buses from various depots to starting points, we consider a class of the capacitated transportation problems with bounds on total availabilities at sources and total destination requirements. It is often difficult to solve such problems and the present paper establishes their equivalence with a balanced capacitated transportation problem which can be easily solved by existing methods. Sometimes, total flow in transportation problem is also specified by some external decision maker because of budget/political consideration and optimal solution of such problem is of practical interest to the decision maker and has motivated us to discuss such problem. Various situations arising in unbalanced capacitated transportation problems have been discussed in the present paper as a particular case of original problem. In addition, we have discussed paradoxical situation in a balanced capacitated transportation problem and have obtained the paradoxical solution by solving one of the unbalanced problems. Numerical illustrations are included in support of theory.     

Robust spectral risk optimization when the subjective risk aversion is ambiguous: a moment-type approach

Choice of a risk measure for quantifying risk of an investment portfolio depends on the decision maker’s risk preference. In this paper, we consider the case when such a preference can be described by a law invariant coherent risk measure but the choice of a specific risk measure is ambiguous. We propose a robust spectral risk approach to address such ambiguity. Differing from Wang and Xu (SIAM J Optim 30(4):3198–3229, 2020), the new robust model allows one to elicit the decision maker’s risk preference through pairwise comparisons and use the elicited preference information to construct an ambiguity set of risk spectra. The robust spectral risk measure (RSRM) is based on the worst case risk spectrum from the set. To calculate RSRM and solve the associated optimal decision making problem, we use a technique from Acerbi and Simonetti (Portfolio optimization with spectral measures of risk. Working paper, 2002) to develop a new computational approach which is independent of order statistics and reformulate the robust spectral risk optimization problem as a single deterministic convex programming problem when the risk spectra in the ambiguity set are step-like. Moreover, we propose an approximation scheme when the risk spectra are not step-like and derive a bound for the model approximation error and its propagation to the optimal decision making problems. Some preliminary numerical test results are reported about the performance of the robust model and the computational scheme.

     

Ranking robustness and its application to evacuation planning

We present a new approach to handle uncertain combinatorial optimization problems that uses solution ranking procedures to determine the degree of robustness of a solution. Unlike classic concepts for robust optimization, our approach is not purely based on absolute quantitative performance, but also includes qualitative aspects that are of major importance for the decision maker.We discuss the two variants, solution ranking and objective ranking robustness, in more detail, presenting problem complexities and solution approaches. Using an uncertain shortest path problem as a computational example, the potential of our approach is demonstrated in the context of evacuation planning due to river flooding.     

Dynamic decision making without expected utility: An operational approach

Non-expected utility theories, such as rank dependent utility (RDU) theory, have been proposed as alternative models to EU theory in decision making under risk. These models do not share the separability property of expected utility theory. This implies that, in a decision tree, if the reduction of compound lotteries assumption is made (so that preferences at each decision node reduce to RDU preferences among lotteries) and that preferences at different decision nodes are identical (same utility function and same weighting function), then the preferences are not dynamically consistent; in particular, the sophisticated strategy, i.e., the strategy generated by a standard rolling back of the decision tree, is likely to be dominated w.r.t. stochastic dominance. Dynamic consistency of choices remains feasible, and the decision maker can avoid dominated choices, by adopting a non-consequentialist behavior, with his choices in a subtree possibly depending on what happens in the rest of the tree. We propose a procedure which: (i) although adopting a non-consequentialist behavior, involves a form of rolling back of the decision tree; (ii) selects a non-dominated strategy that realizes a compromise between the decision maker’s discordant goals at the different decision nodes. Relative to the computations involved in the standard expected utility evaluation of a decision problem, the main computational increase is due to the identification of non-dominated strategies by linear programming. A simulation, using the rank dependent utility criterion, confirms the computational tractability of the model.     

Single- and multi-objective defensive location problems on a network

This paper considers a new optimal location problem, called defensive location problem (DLP). In the DLPs, a decision maker locates defensive facilities in order to prevent her/his enemies from reaching an important site, called a core; for example, “a government of a country locates self-defense bases in order to prevent her/his aggressors from reaching the capital of the country.” It is assumed that the region where the decision maker locates her/his defensive facilities is represented as a network and the core is a vertex in the network, and that the facility locater and her/his enemy are an upper and a lower level of decision maker, respectively. Then the DLPs are formulated as bilevel 0-1 programming problems to find Stackelberg solutions. In order to solve the DLPs efficiently, a solving algorithm for the DLPs based upon tabu search methods is proposed. The efficiency of the proposed solving methods is shown by applying to examples of the DLPs. Moreover, the DLPs are extended to multi-objective DLPs that the decision maker needs to defend several cores simultaneously. Such DLPs are formulated as multi-objective programming problems. In order to find a satisfying solution of the decision maker for the multi-objective DLP, an interactive fuzzy satisfying method is proposed, and the results of applying the method to examples of the multi-objective DLPs are shown.     

Two level hierarchical time minimizing transportation problem

A two level hierarchical balanced time minimizing transportation problem is considered in this paper. The whole set of source-destination links consists of two disjoint partitions namely Level-I links and Level-II links. Some quantity of a homogeneous product is first shipped from sources to destinations by Level-I decision maker using only Level-I links, and on its completion the Level-II decision maker transports the remaining quantity of the product in an optimal fashion using only Level-II links. Transportation is assumed to be done in parallel in both the levels. The aim is to find that feasible solution for Level-I decision maker corresponding to which the optimal feasible solution for Level-II decision maker is such that the sum of shipment times in Level-I and Level-II is the least. To obtain the global optimal feasible solution of this non-convex optimization problem, related balanced time minimizing transportation problems are defined. Based upon the optimal feasible solutions of these related problems, standard cost minimizing transportation problems are constructed whose optimal feasible solutions provide various pairs for shipment times for Level-I and Level-II decision makers. The best out of these pairs is finally selected. Being dependent upon solutions of a finite number of balanced time minimizing and cost minimizing transportation problems, the proposed algorithm is a polynomial bound algorithm. The developed algorithm has been implemented and tested on a variety of test problems and performance is found to be quite encouraging.     

Network production-location problems under price uncertainty

The scope of the network plant location problem is extended in three significant ways: (i) The ‘design’ of the facility, including consideration of input substitution and the level of output, is combined with the location decision; (ii) input and output prices are treated as random variables, and (iii) the risk preferences of the decision maker are considered explicitly in the decision making process. Node optimality properties are developed for several model variations. An elimination-by-bound solution algorithm is presented along with suggested upper and lower bounds and methods of simplification. Under certain conditions, the optimal input ratios and plant locations are shown to be invariant with some parametric changes. The potential for influencing the location decisions of firms, depending upon the characteristics of their risk preferences, production functions, and the demand functions for their input, through manipulation of the risk they face, is illustrated.     

Interactive procedure for a multiobjective stochastic discrete dynamic problem

Multiple objectives and dynamics characterize many sequential decision problems. In the paper we consider returns in partially ordered criteria space as a way of generalization of single criterion dynamic programming models to multiobjective case. In our problem evaluations of alternatives with respect to criteria are represented by distribution functions. Thus, the overall comparison of two alternatives is equivalent to the comparison of two vectors of probability distributions. We assume that the decision maker tries to find a solution preferred to all other solutions (the most preferred solution). In the paper a new interactive procedure for stochastic, dynamic multiple criteria decision making problem is proposed. The procedure consists of two steps. First, the Bellman principle is used to identify the set of efficient solutions. Next interactive approach is employed to find the most preferred solution. A numerical example and a real-world application are presented to illustrate the applicability of the proposed technique.     

A Model to Evaluate the Effect of Organizational Adaptation

When an organization's output declines due to either internal changes or changes in its external environment, it needs to adapt. In order to evaluate the effectiveness of different adaptation strategies on organizational performance, an organizational model composed of individual models of a five stage interacting decision maker was designed using an object oriented design approach and implemented as a Colored Petri net. The concept of entropy is used to calculate the total activity value, a surrogate for decision maker workload, based on the functional partition and the adaptation strategy being implemented. The individual decision maker's total activity is monitored, as overloaded decision makers constrain organizational performance. A virtual experiment was conducted; organizations implementing local and global adaptation strategies were compared to a control organization with no adaptation. The level of tolerance of the organization, the workload limit based on the concept of the bounded rationality constraint, was used to determined when a decision maker was overloaded: the limiting effect of the workload on performance. The timeliness of the organization's response was used in order to evaluate organizational output as a function of adaptation strategy.