Derivation of intuitionistic fuzzy weights based on intuitionistic fuzzy preference relations

This paper proposes linear goal programming models for deriving intuitionistic fuzzy weights from intuitionistic fuzzy preference relations. Novel definitions are put forward to define additive consistency and weak transitivity for intuitionistic fuzzy preference relations, followed by a study of their corresponding properties. For any given normalized intuitionistic fuzzy weight vector, a transformation formula is furnished to convert the weights into a consistent intuitionistic fuzzy preference relation. For any intuitionistic fuzzy preference relation, a linear goal programming model is developed to obtain its intuitionistic fuzzy weights by minimizing its deviation from the converted consistent intuitionistic fuzzy preference relation. This approach is then extended to group decision-making situations. Three numerical examples are provided to illustrate the validity and applicability of the proposed models.     

A method for estimating criteria weights from intuitionistic preference relations

An intuitionistic preference relation is a powerful means to express decision makers’information of intuitionistic preference over criteria in the process of multi-criteria decision making. In this paper, we first define the concept of its consistence and give the equivalent interval fuzzy preference relation of it. Then we develop a method for estimating criteria weights from it, and then extend the method to accommodate group decision making based on them And finally, we use some numerical examples to illustrate the feasibility and validity of the developed method.     

On consistency measures of linguistic preference relations

Inspired by the concept of deviation measure between two linguistic preference relations, this paper further defines the deviation measure of a linguistic preference relation to the set of consistent linguistic preference relations. Based on this, we present a consistency index of linguistic preference relations and develop a consistency measure method for linguistic preference relations. This method is performed to ensure that the decision maker is being neither random nor illogical in his or her pairwise comparisons using the linguistic label set. Using this consistency measure, we discuss how to deal with inconsistency in linguistic preference relations, and also investigate the consistency properties of collective linguistic preference relations. These results are of vital importance for group decision making with linguistic preference relations.     

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.     

Deriving priority weights from intuitionistic multiplicative preference relations under group decision-making settings

The intuitionistic multiplicative preference relation (IMPR), which takes into account both the ratio degree to which an alternative is preferred to another and the ratio degree to which an alternative is non-preferred to another, is a useful tool for decision makers to elicit their preference information using Saaty’s 1–9 scale. In this paper, we focus on group decision making with IMPRs. First, we analyze the flaws of the consistency definition of an IMPR in previous work and then propose a new definition to overcome the flaws. On this basis, a linear programming-based algorithm is developed to check and improve the consistency of an IMPR. Second, we discuss the relationships between an IMPR and a normalized intuitionistic multiplicative weight vector and develop two approaches to group decision making based on complete and incomplete IMPRs, respectively. Based on the proposed algorithm and approaches, a general framework for group decision making with IMPRs is proposed. Finally, some numerical examples are provided to demonstrate the proposed approaches. The results show that the proposed approaches can deal with group decision-making problems with IMPRs effectively.     

A method based on similarity measures for interactive group decision-making with intuitionistic fuzzy preference relations

In this paper, we study the group decision-making problem in which the preference information given by experts takes the form of intuitionistic fuzzy preference relations, and the information about experts’ weights is completely unknown. We first utilize the intuitionistic fuzzy weighted averaging operator to aggregate all individual intuitionistic fuzzy preference relations into a collective intuitionistic fuzzy preference relation. Then, based on the degree of similarity between the individual intuitionistic fuzzy preference relations and the collective one, we develop an approach to determine the experts’ weights. Furthermore, based on intuitionistic fuzzy preference relations, a practical interactive procedure for group decision-making is proposed, in which the similarity measures between the collective preference relation and intuitionistic fuzzy ideal solution are used to rank the given alternatives. Finally, an illustrative numerical example is given to verify the developed approach.     

Common probability-based interactive algorithms for group decision making with normalized probability linguistic preference relations

Fuzzy Optimization and Decision Making - Probabilistic linguistic variable is a kind of powerful qualitative fuzzy sets, which permits the decision makers (DMs) to apply several linguistic...     

A consistency and consensus-based method to group decision making with interval linguistic preference relations

Preference relations are a powerful tool to address decision-making problems. In some situations, because of the complexity of decision-making problems and the inherent uncertainty, the decision makers cannot express their preferences by using numerical values. Interval linguistic preference relations, which are more reliable and informative for the decision-makers’ preferences, are a good choice to cope with this issue. Just as with the other types of preference relations, the consistency and consensus analysis is very importance to ensure the reasonable ranking order by using interval linguistic preference relations. Considering this situation, this paper introduces a consistency concept for interval linguistic preference relations. To measure the consistency of interval linguistic preference relations, a consistency measure is defined. Then, a consistency-based programming model is built, by which the consistent linguistic preference relations with respect to each object can be obtained. To cope with the inconsistency case, two models for deriving the adjusted consistent linguistic preference relations are constructed. Then, a consistency-based programming model to estimate the missing values is built. After that, we present a group consensus index and present some of its desirable properties. Furthermore, a group consensus-based model to determine the weights of the decision makers with respect to each object is established. Finally, an approach to group decision making with interval linguistic preference relations is developed, which is based on the consistency and consensus analysis. Meanwhile, the associated numerical examples are offered to illustrate the application of the procedure.     

A comparative analysis of probabilistic linguistic preference relations and distributed preference relations for decision making

Fuzzy Optimization and Decision Making - When a decision-maker prefers to compare different alternatives in pairs to handle real situations, there are many different expression styles that can be...     

Iterative algorithms for generalized mixed equilibrium problems

In this paper, we consider a generalized mixed equilibrium problem in real Hilbert space. Using the auxiliary principle, we define a class of resolvent mappings. Further, using fixed point and resolvent methods, we give some iterative algorithms for solving generalized mixed equilibrium problem. Furthermore, we prove that the sequences generated by iterative algorithms converge weakly to the solution of generalized mixed equilibrium problem. These results require monotonicity (θ-pseudo monotonicity) and continuity (Lipschitz continuity) for mappings.     

Iterative algorithms for solving some tensor equations

We propose a class of iterative algorithms to solve some tensor equations via Einstein product. These algorithms use tensor computations with no matricizations involved. For any (special) initial tensor, a solution (the minimal Frobenius norm solution) of related problems can be obtained within finite iteration steps in the absence of roundoff errors. Numerical examples are provided to confirm the theoretical results, which demonstrate that this kind of iterative methods are effective and feasible for solving some tensor equations.     

Iterative algorithms for generalized monotone variational inequalities

We propose some new iterative methods for solving the generalized variational inequalities where the underlying operator T is monotone. These methods may be viewed as projection-type methods. Convergence of these methods requires that the operator T is only monotone. The methods and the proof of the convergence are very simple. The results proved in this paper also represent a significant improvement and refinement of the known results.     

Iterative algorithms for the curfew planning problem

The curfew planning problem is to design an annual timetable for railway track maintenance teams. Each team is capable of handling certain types of repairs and replacement jobs. The jobs are combined into a set of projects according to their locations and types. The timetable shows which project should be worked on by each team on a weekly basis throughout an entire year. Our objective is to design a schedule with minimum network disruption due to ongoing maintenance projects that require absolute curfew. Absolute curfew projects are those that cause complete closure of the rail traffic. For tackling this problem, we develop four optimization-based iterative algorithms. We also present very promising computational results obtained within a few minutes using data provided by a major North American railroad.     

Stochastic preference analysis in numerical preference relations

Numerical preference relations (NPRs) consisting of numerical judgments can be considered as a general form of the existing preference relations, such as multiplicative preference relations (MPRs), fuzzy preference relations (FPRs), interval MPRs (IV-MPRs) and interval FPRs (IV-FPRs). On the basis of NPRs, we develop a stochastic preference analysis (SPA) method to aid the decision makers (DMs) in decision making. The numerical judgments in NPRs can also be characterized by different probability distributions in accordance with practice. By exploring the judgment space of NPRs, SPA produces several outcomes including the rank acceptability index, the expected priority vector, the expected rank and the confidence factor. The outcomes are obtained by Monte Carlo simulation with at least 95% confidence degree. Based on the outcomes, the DMs can choose some of them which they find most useful to make reliable decisions.     

Iterative algorithms for inverse-strongly accretive mappings with applications

The purpose of this paper is to consider an iterative method for finding solutions to a variational inequality for inverse-strongly accretive mappings. Strong convergence theorems, which are an analogue of weak convergence theorems proved by Aoyama, Iiduka and Takahashi (Fixed Point Theory Appl. 2006, 35390, 2006), are established in the framework of Banach spaces.     

Iterative algorithms for nonlinear problems in remote sensing

First a brief review of the Backus and Gilbert method for the linear problems is given. Then a comprehensive presentation of iterative algorithms for constructing approximate solutions of nonlinear problems from erroneous inadequate data is given. Proofs of convergence and error estimates of these iterative algorithms are obtained. It is found that locally the limit of the iterates does not satisfy the original nonlinear operator equation, but a somewhat different nonlinear equation which depends on the initial iterate. A nonlinear radiative transfer equation in remote sensing of the atmospheric temperature profiles is used as an example to demonstrate the applicability of the iterative algorithms. Finally, a discussion of the present status of research in this domain and some personal views on what should be the useful lines for future research is given.     

Non-dominance and potential optimality for partial preference relations

In this paper we obtain new theoretical results relating the notions of potential optimality and non-dominance without an assumption that a value function exists. In particular, we investigate a decision problem involving the choice of single or multiple best objects. Our results show that the notions of potential optimality and non-dominance are equivalent in a special case of preferences of the decision maker expressed by partial quasi-orders.     

Distributed preference relations for multiple attribute decision analysis

In this paper, we propose a new pairwise comparison approach called distributed preference relation (DPR) to simultaneously signify preferred, non-preferred, indifferent, and uncertain degrees of one alternative over another on a set of grades, which is more versatile for elicitation of preference information from a decision maker than multiplicative preference relation, fuzzy preference relation (FPR) and intuitionistic FPR. In a DPR matrix on a set of alternatives, each element is a distribution recording the preferred, non-preferred, indifferent, and uncertain degrees of one alternative over another using a set of grades. To facilitate the comparison of alternatives, we define a score matrix based on a DPR matrix using the given score values of the grades. Its additive consistency is constructed, analysed, and compared with the additive consistency of FPRs between alternatives. A method for comparing two interval numbers is then employed to create a possibility matrix from the score matrix, which can generate a ranking order of alternatives with possibility degrees. A problem of evaluating strategic emerging industries is investigated using the approach to demonstrate the application of a DPR matrix to modelling and analysing a multiple attribute decision analysis problem.     

Iterative algorithms with variable anchors for non-expansive mappings

In this paper, we suggest and analyze some new iterative algorithms with variable anchors for non-expansive mapping in Banach spaces. We prove that the proposed iterative algorithms converge strongly to a fixed point of some non-expansive mapping. We also obtain some corollaries which include some results as special cases. Furthermore, we conclude the strong convergence of the so-called viscosity iterative algorithms.