Extension of VIKOR method for multi-criteria group decision making problem with linguistic information

A new method is proposed to solve multi-criteria group decision making problems in which both the criteria values and criteria weights take the form of linguistic information based on the traditional idea of VIKOR method. Firstly, the linguistic criteria weights given by all decision makers are transformed into trapezoidal fuzzy numbers, and then aggregated and defuzzified to crisp values. Secondly, the individual linguistic decision matrix given by each decision maker (DM) is transformed into 2-tuple linguistic decision matrix, and then aggregated into collective 2-tuple linguistic decision matrix by 2-tuple linguistic arithmetic mean operation. Thirdly, the 2-tuple linguistic values (_Si,_αi),$(S_i\text{,}{\alpha }_i)\text{,}$(_Ri,_αi)$(R_i\text{,}{\alpha }_i)$ and (_Qi,_αi)$(Q_i\text{,}{\alpha }_i)$ are calculated by defining the 2-tuple linguistic positive ideal solution (TL-PIS) and 2-tuple linguistic negative ideal solution (TL-NIS). Furthermore, the compromise solution can be obtained. Finally, a numerical example is used to illustrate the application of the proposed approach, and the method is verified by comparing the evaluation result with that of 2-tuple linguistic TOPSIS (TL-TOPSIS) method.     

A new method for multiple criteria group decision making with incomplete weight information under linguistic environment

A new method is proposed to solve multiple criteria group decision making (MCGDM) problems, in which both the criteria values and criteria weights take the form of linguistic information, and the information about linguistic criteria weights is partly known or completely unknown. Firstly, to get reasonable decision result, instead of assigning the same weight to the decision maker (DM) for all criteria, we propose a method to determine the weight of DM with respect to each criterion under linguistic environment by calculating the similarity degree between individual 2-tuple linguistic evaluation value and the mean given by all decision makers (DMs). Secondly, for the situations where the information about the criteria weights is partly known or completely unknown, we establish optimization models to determine the criteria weights by defining 2-tuple linguistic positive ideal solution (TL-PIS), 2-tuple linguistic right negative ideal solution (TL-RNIS) and 2-tuple linguistic left negative ideal solution (TL-LNIS) of the collective 2-tuple linguistic decision matrix. Thirdly, we propose a new method to solve MCGDM problems with partly known or completely unknown linguistic weight information. Finally, an illustrative example is given to demonstrate the calculation process of the proposed method.     

A multiobjective evolutionary approach for linearly constrained project selection under uncertainty

In the project selection problem a decision maker is required to allocate limited resources among an available set of competing projects. These projects could arise, although not exclusively, in an R&D, information technology or capital budgeting context. We propose an evolutionary method for project selection problems with partially funded projects, multiple (stochastic) objectives, project interdependencies (in the objectives), and a linear structure for resource constraints. The method is based on posterior articulation of preferences and is able to approximate the efficient frontier composed of stochastically nondominated solutions. We compared the method with the stochastic parameter space investigation method (PSI) and illustrate it by means of an R&D portfolio problem under uncertainty based on Monte Carlo simulation.     

Numerical scales generated individually for analytic hierarchy process

Because individual interpretations of the analytic hierarchy process (AHP) linguistic scale vary for each user, this study proposes a novel framework that AHP decision makers can use to generate numerical scales individually, based on the 2-tuple linguistic modeling of AHP scale problems. By using the concept of transitive calibration, individual characteristics in understanding the AHP linguistic scale are first defined. An algorithm is then proposed for detecting the individual characteristics from the linguistic pairwise comparison data that is associated with each of the AHP individual decision makers. Finally, a nonlinear programming model is proposed to generate individual numerical scales that optimally match the obtained individual characteristics. Two well-known numerical examples are re-examined using the proposed framework to demonstrate its validity.     

Skill-based framework for optimal software project selection and resource allocation

This paper presents a conceptual framework and a mathematical formulation for software resource allocation and project selection at the level of software skills. First, we introduce a skill-based framework that considers universities, software companies, and potential projects of a country. Based on this framework, we formulate a linear integer program PMax which determines the selection of projects and the allocation of human resources that maximize profit for a certain company. We show that PMax is NP-complete. Therefore, we devise a meta-heuristic, called Tabu Select and Greedily Allocate (TSGA), to overcome the computational complexities. When compared to PMax running on CPLEX, TSGA performs 15 times faster with an accuracy of 98% on small to large size problems where CPLEX converges. On larger problems where CPLEX does not return an answer, TSGA computes a feasible solution in the order of minutes.     

Preference programming for robust portfolio modeling and project selection

In decision analysis, difficulties of obtaining complete information about model parameters make it advisable to seek robust solutions that perform reasonably well across the full range of feasible parameter values. In this paper, we develop the Robust Portfolio Modeling (RPM) methodology which extends Preference Programming methods into portfolio problems where a subset of project proposals are funded in view of multiple evaluation criteria. We also develop an algorithm for computing all non-dominated portfolios, subject to incomplete information about criterion weights and project-specific performance levels. Based on these portfolios, we propose a project-level index to convey (i) which projects are robust choices (in the sense that they would be recommended even if further information were to be obtained) and (ii) how continued activities in preference elicitation should be focused. The RPM methodology is illustrated with an application using real data on road pavement projects.     

A priority-rule method for project scheduling with work-content constraints

The activities of a project are in general characterized by a work content in terms of resource–time units, e.g. person-days. Even though most project scheduling models assume a time-invariant resource usage, normally it is possible to vary the resource usage during the execution of an activity. Typically, a lower and an upper bound on this resource usage and a minimum time lag between consecutive changes of this resource usage are prescribed. The project scheduling problem studied in this paper consists in determining a feasible resource-usage profile for each activity such that the project duration is minimized subject to precedence and resource-capacity constraints. While the known solution methods interpret the prescribed work content as a lower bound, we assume that each activity’s work content must be processed exactly.     

An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem

This paper investigates the construction of an automatic algorithm selection tool for the multi-mode resource-constrained project scheduling problem (MRCPSP). The research described relies on the notion of empirical hardness models. These models map problem instance features onto the performance of an algorithm. Using such models, the performance of a set of algorithms can be predicted. Based on these predictions, one can automatically select the algorithm that is expected to perform best given the available computing resources. The idea is to combine different algorithms in a super-algorithm that performs better than any of the components individually. We apply this strategy to the classic problem of project scheduling with multiple execution modes. We show that we can indeed significantly improve on the performance of state-of-the-art algorithms when evaluated on a set of unseen instances. This becomes important when lots of instances have to be solved consecutively. Many state-of-the-art algorithms perform very well on a majority of benchmark instances, while performing worse on a smaller set of instances. The performance of one algorithm can be very different on a set of instances while another algorithm sees no difference in performance at all. Knowing in advance, without using scarce computational resources, which algorithm to run on a certain problem instance, can significantly improve the total overall performance.     

A new multi-criteria approach dealing with dependent and heterogeneous criteria for end-of-life product strategy

Strict regulations, technological growth and environmental impacts are influent factors in the choice of the best strategy for end-of-life (EOL) product. In fact, EOL is one stage of the life cycle having gained the attention of the market.This study proposes an integrated methodology that relies on multi-criteria analysis and takes into account both quantitative and qualitative criteria while respecting mutual interactions between them. This has been performed by introducing, on the one hand, the 2-tuple linguistic representation model dealing with non-homogeneous information data, and on the other hand, the Choquet integral interaction modeling between criteria into the PROMETHEE method. Although it has been developed for EOL selection problems, the proposed method fits to all kinds of decision-making problems with heterogeneous information. As this work demonstrates, this multi-criteria analysis approach can offer a technical-scientific decision making support tool in the EOL product sector. We also perform a sensitivity to reveal the effect of the subjective parameter variations on the originally resulted ranking.     

Numerical methods for portfolio selection with bounded constraints

This work develops an approximation procedure for portfolio selection with bounded constraints. Based on the Markov chain approximation techniques, numerical procedures are constructed for the utility optimization task. Under simple conditions, the convergence of the approximation sequences to the wealth process and the optimal utility function is established. Numerical examples are provided to illustrate the performance of the algorithms.     

Non-probabilistic convex models and interval analysis method for dynamic response of a beam with bounded uncertainty

This paper is concerned with the comparison of two non-probabilistic set-theoretical models for dynamic response measures of an infinitely long beam. The beam is on an uncertain foundation and subjected to a moving force with constant speed. The steady state vibration is analyzed with finite element method. The dynamic responses of the beam are approximated to the first-order respect of the uncertainty variables. As a rule, in convex models and interval analysis, the uncertainties are considered to be unknown, but they give out their allowable vector space. Comparing the convex models with interval analysis in mathematical proofs and numerical calculations, it’s shows that under the condition of transform an interval vector to an outer enclosed ellipsoid, the dynamic response of the infinitely long beam predicted by interval analysis is smaller than that by convex models; under the condition of transform a hyperellipsoid to an outer enclosed interval vector, the dynamic response of the infinitely long beam calculated by convex models is smaller than that by interval analysis method.     

A multistage differential transformation method for approximate solution of Hantavirus infection model

The goal of this study is presented a reliable algorithm based on the standard differential transformation method (DTM), which is called the multi-stage differential transformation method (MsDTM) for solving Hantavirus infection model. The results obtanied by using MsDTM are compared to those obtained by using the Runge-Kutta method (R-K-method). The proposed technique is a hopeful tool to solving for a long time intervals in this kind of systems.     

The extended QUALIFLEX method for multiple criteria decision analysis based on interval type-2 fuzzy sets and applications to medical decision making

QUALIFLEX, a generalization of Jacquet-Lagreze’s permutation method, is a useful outranking method in decision analysis because of its flexibility with respect to cardinal and ordinal information. This paper develops an extended QUALIFLEX method for handling multiple criteria decision-making problems in the context of interval type-2 fuzzy sets. Interval type-2 fuzzy sets contain membership values that are crisp intervals, which are the most widely used of the higher order fuzzy sets because of their relative simplicity. Using the linguistic rating system converted into interval type-2 trapezoidal fuzzy numbers, the extended QUALIFLEX method investigates all possible permutations of the alternatives with respect to the level of concordance of the complete preference order. Based on a signed distance-based approach, this paper proposes the concordance/discordance index, the weighted concordance/discordance index, and the comprehensive concordance/discordance index as evaluative criteria of the chosen hypothesis for ranking the alternatives. The feasibility and applicability of the proposed methods are illustrated by a medical decision-making problem concerning acute inflammatory demyelinating disease, and a comparative analysis with another outranking approach is conducted to validate the effectiveness of the proposed methodology.     

Using thresholding difference-based estimators for variable selection in partial linear models

A commonly used semiparametric model is considered. We adopt two difference based estimators of the linear component of the model and propose corresponding thresholding estimators that can be used for variable selection. For each thresholding estimator, variable selection in the linear component is developed and consistency of the variable selection procedure is shown. We evaluate our method in a simulation study and implement it on a real data set.     

A closed form type reduction method for piecewise linear interval type-2 fuzzy sets

In this study, a new centroid type reduction method is proposed for piecewise linear interval type-2 fuzzy sets based on geometrical approach. The main idea behind the proposed method relies on the assumption that the part of footprint of uncertainty (FOU) of an interval type-2 fuzzy set (IT2FS) has a constant width where the centroid is searched. This constant width assumption provides a way to calculate the centroid of an IT2FS in closed form by using derivative based optimization without any need of iterations. When the related part of FOU is originally constant width, the proposed method finds the accurate centroid of an IT2FS; otherwise, an enhancement can be performed in the algorithm in order to minimize the error between the accurate and the calculated centroids. Moreover, only analytical formulas are used in the proposed method utilizing geometry. This eliminates the need of using discretization of an IT2FS for the type reduction process which in return naturally improves the accuracy and the computation time. The proposed method is compared with Enhanced Karnik–Mendel Iterative Procedure (EKMIP) in terms of the accuracy and the computation time on seven test fuzzy sets. The results show that the proposed method provides more accurate results with shorter computation time than EKMIP.     

Terminal perturbation method for the backward approach to continuous time mean–variance portfolio selection

A terminal perturbation method is introduced to study the backward approach to continuous time mean–variance portfolio selection with bankruptcy prohibition in a complete market model. Using Ekeland’s variational principle, we obtain a necessary condition, i.e. the stochastic maximum principle, which the optimal terminal wealth satisfies. This method can deal with nonlinear wealth equation with bankruptcy prohibition and several examples are given to show applications of our results.     

A Nyström method for solving 2sth order boundary value problems

A Nyström method is proposed for solving Fredholm integral equations equivalent to special boundary value problems of order 2s. The stability and the convergence of the proposed procedure is proved. Some numerical examples are provided in order to illustrate the accuracy of the method.     

Law of iterated logarithm and model selection consistency for generalized linear models with independent and dependent responses

We study the law of the iterated logarithm (LIL) for the maximum likelihood estimation of the parameters (as a convex optimization problem) in the generalized linear models with independent or weakly dependent (\rho-mixing) responses under mild conditions. The LIL is useful to derive the asymptotic bounds for the discrepancy between the empirical process of the log-likelihood function and the true log-likelihood. The strong consistency of some penalized likelihood-based model selection criteria can be shown as an application of the LIL. Under some regularity conditions, the model selection criterion will be helpful to select the simplest correct model almost surely when the penalty term increases with the model dimension, and the penalty term has an order higher than O(log log n) but lower than O(n): Simulation studies are implemented to verify the selection consistency of Bayesian information criterion.     

Analysis of second order and unconditionally stable BDF2‐AB2 method for the Navier‐Stokes equations with nonlinear time relaxation

In this study, we first consider a second order time stepping finite element BDF2‐AB2 method for the Navier‐Stokes equations (NSE). We prove that the method is unconditionally stable and accurate. Second, we consider a nonlinear time relaxation model which consists of adding a term “” to the Navier‐Stokes Equations with the algorithm depends on BDF2‐AB2 method. We prove that this method is unconditionally stable, too. We applied the BDF2‐AB2 method to several numeral experiments including flow around the cylinder. We have also applied BDF2‐AB2 method with nonlinear time relaxation to some problems. It is observed that when the equilibrium errors are high, applying BDF2‐AB2 with nonlinear time relaxation method to the problem yields lower equilibrium errors.     

Error estimate in L2 of a covolume method for the generalized Stokes problem

We investigate an L²‐error estimate of a covolume scheme for the Stokes problem recently introduced by Chou (Math Comp 66 (1997), 85–104). We show the error in L² norm is of second order provided the exact velocity is in H ³ and the exact pressure is in H². © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006