The properties of fuzzy tensor and the product of fuzzy tensor and fuzzy vector are studied in the paper. The concept of fuzzy tensor is defined through expanding the fuzzy matrix. The product of fuzzy tensor and fuzzy vector is proved to be a fuzzy linear transformation. The general form of the fuzzy synthetic evaluation model is established to solve multiple attribute group decision making problems. Finally, two numerical examples of multiple attribute group decision making are provided to demonstrate the feasibility and efficiency of the fuzzy synthetic evaluation.
1 January 2019 in International Journal of Computational Intelligence Systems
To solve the interval-valued intuitionistic fuzzy decision-making problems with high-dimension data, the fuzzy matrix is extended to the fuzzy tensor in this paper. Based on the constructed tensor definition, we propose the generalized interval-valued intuitionistic fuzzy weighted averaging (GIIFWA) and generalized interval-valued intuitionistic fuzzy weighted geometric (GIIFWG) operators. By exploring the properties of GIIFWA and GIIFWG operators, a new algorithm is presented to solve the interval-valued intuitionistic fuzzy multiple attribute group decision-making problem. Two typical application examples are also provided to demonstrate the efficiency and universal applicability of our proposed method.
23 October 2025 in International Journal of Fuzzy Systems
The problem of bilevel decision-making under multi-expert uncertain information is addressed in this paper. Traditional fuzzy bilevel models are unable to accurately quantify expert consensus and capture evaluation hesitation. To overcome these limitations, a fully hesitant fuzzy bilevel linear programming model is proposed, in which all coefficients and decision variables are characterized by hesitant fuzzy numbers. By virtue of -cuts, the original model is equivalently transformed into an interval-valued bilevel programming problem and further decomposed into best–best and worst–worst sub-models to derive the upper and lower bounds of optimal solutions. Under the Slater constraint qualification, Karush–Kuhn–Tucker (KKT) conditions are adopted to convert the two sub-models into single-level mathematical programs with complementarity constraints (MPCCs), thereby enabling efficient model solving. The proposed method is applied to the resource allocation problem in quantum communication networks. The numerical results demonstrate that the optimal solution interval converges to a unique core value as the membership-level increases, while a larger consensus parameter k reduces the fuzzy support set without altering the core solution.