Super Fuzzy Matrices and Super Fuzzy Models for Social Scientists

This book introduces the concept of fuzzy super matrices and operations on them. This book will be highly useful to social scientists who wish to work with multi-expert models. Super fuzzy models using Fuzzy Cognitive Maps, Fuzzy Relational Maps, Bidirectional Associative Memories and Fuzzy Associative Memories are defined here. The authors introduce 13 multi-expert models using the notion of fuzzy supermatrices. These models are described with illustrative examples. This book has three chapters. In the first chaper, the basic concepts about super matrices and fuzzy super matrices are recalled. Chapter two introduces the notion of fuzzy super matrices adn their properties. The final chapter introduces many super fuzzy multi expert models.Comment: 280 page

A Posynomial Geometric Programming Restricted to a System of Fuzzy Relation Equations

AbstractA posynomial geometric optimization problem subjected to a system of max-min fuzzy relational equations (FRE) constraints is considered. The complete solution set of FRE is characterized by unique maximal solution and finite number of minimal solutions. A two stage procedure has been suggested to compute the optimal solution for the problem. Firstly all the minimal solutions of fuzzy relation equations are determined. Then a domain specific evolutionary algorithm (EA) is designed to solve the optimization problems obtained after considering the individual sub-feasible region formed with the help of unique maximum solution and each of the minimal solutions separately as the feasible domain with same objective function. A single optimal solution for the problem is determined after solving these optimization problems. The whole procedure is illustrated with a numerical example

Диагностика на основе многомерных нечетких отношений

Розглянуто відновлення причин (діагнозів) за спостережуваними наслідками (симптомами) на основі багатовимірних нечітких відношень і розширеного композиційного правила виведення. Проектування нечіткої системи діагностики полягає у розв’язанні нечітких логічних рівнянь сумісно з налаштуванням нечітких відношень на основі експертно-експериментальної інформації. Запропоновано метод розв’язання систем нечітких логічних рівнянь з розширеною max-min композицією. Доведено властивості множини розв’язків таких систем. Задачу знаходження множини розв’язків сформульовано у вигляді задачі оптимізації, для розв’язання якої використано генетико-нейронний підхід. Налаштування полягає у виборі таких функцій належності нечітких причин і наслідків, а також нечітких відношень, які мінімізують різницю між модельними і експериментальними результатами діагностики. Запропонований підхід проілюстровано комп’ютерним експериментом і прикладом технічної діагностики.This paper deals with restoration of the causes (diagnoses) through the observed effects (symptoms) on the basis of multivariable fuzzy relations and the extended compositional rule of inference. The design of a diagnostic fuzzy system consists of solving fuzzy relational equations together with tuning of fuzzy relations on the basis of information from experts and experiments. We propose a method for solving fuzzy relational equations with the extended max-min composition. We also prove the properties of the solution set for such systems. The problem of finding the solution set is formulated in the form of the optimization problem, which is solved using genetic algorithms and neural networks. The essence of tuning consists of the selection such membership functions for fuzzy causes and effects, and also fuzzy relations, which minimize the difference between model and experimental results of a diagnosis. The proposed approach is illustrated by the computer experiment and the example of a technical diagnosis.Рассмотрено восстановление причин (диагнозов) по наблюдаемым следствиям (симптомам) на основе многомерных нечетких отношений и расширенного композиционного правила выведения. Проектирование нечеткой системы диагностики состоит в решении нечетких логических уравнений совместно с настройкой нечетких отношений на основе экспертно-экспериментальной информации. Предложен метод решения систем нечетких логических уравнений с расширенной max-min композицией. Доказаны свойства множества решений таких систем. Задача нахождения множества решений сформулирована в виде задачи оптимизации, для решения которой используется генетико-нейронный подход. Настройка состоит в выборе таких функций принадлежности нечетких причин и следствий, а также нечетких отношений, которые минимизируют отличие между модельными и экспериментальными результатами диагностики. Предложенный подход проиллюстрирован компьютерным экспериментом и примером технической диагностики

An exact algorithm for linear optimization problem subject to max-product fuzzy relational inequalities with fuzzy constraints

Fuzzy relational inequalities with fuzzy constraints (FRI-FC) are the generalized form of fuzzy relational inequalities (FRI) in which fuzzy inequality replaces ordinary inequality in the constraints. Fuzzy constraints enable us to attain optimal points (called super-optima) that are better solutions than those resulted from the resolution of the similar problems with ordinary inequality constraints. This paper considers the linear objective function optimization with respect to max-product FRI-FC problems. It is proved that there is a set of optimization problems equivalent to the primal problem. Based on the algebraic structure of the primal problem and its equivalent forms, some simplification operations are presented to convert the main problem into a more simplified one. Finally, by some appropriate mathematical manipulations, the main problem is transformed into an optimization model whose constraints are linear. The proposed linearization method not only provides a super-optimum (that is better solution than ordinary feasible optimal solutions) but also finds the best super-optimum for the main problem. The current approach is compared with our previous work and some well-known heuristic algorithms by applying them to random test problems in different sizes.Comment: 29 pages, 8 figures, 7 table

Two-Step Many-Objective Optimal Power Flow Based on Knee Point-Driven Evolutionary Algorithm

To coordinate the economy, security and environment protection in the power system operation, a two-step many-objective optimal power flow (MaOPF) solution method is proposed. In step 1, it is the first time that knee point-driven evolutionary algorithm (KnEA) is introduced to address the MaOPF problem, and thereby the Pareto-optimal solutions can be obtained. In step 2, an integrated decision analysis technique is utilized to provide decision makers with decision supports by combining fuzzy c-means (FCM) clustering and grey relational projection (GRP) method together. In this way, the best compromise solutions (BCSs) that represent decision makers' different, even conflicting, preferences can be automatically determined from the set of Pareto-optimal solutions. The primary contribution of the proposal is the innovative application of many-objective optimization together with decision analysis for addressing MaOPF problems. Through examining the two-step method via the IEEE 118-bus system and the real-world Hebei provincial power system, it is verified that our approach is suitable for addressing the MaOPF problem of power systems.Comment: Accepted by Journal Processe

Resolution and simplification of Dombi-fuzzy relational equations and latticized optimization programming on Dombi FREs

In this paper, we introduce a type of latticized optimization problem whose objective function is the maximum component function and the feasible region is defined as a system of fuzzy relational equalities (FRE) defined by the Dombi t-norm. Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. Since the feasible solutions set of FREs is non-convex and the finding of all minimal solutions is an NP-hard problem, designing an efficient solution procedure for solving such problems is not a trivial job. Some necessary and sufficient conditions are derived to determine the feasibility of the problem. The feasible solution set is characterized in terms of a finite number of closed convex cells. An algorithm is presented for solving this nonlinear problem. It is proved that the algorithm can find the exact optimal solution and an example is presented to illustrate the proposed algorithm.Comment: arXiv admin note: text overlap with arXiv:2206.09716, arXiv:2207.0637

Geometric Programming Subject to System of Fuzzy Relation Inequalities

In this paper, an optimization model with geometric objective function is presented. Geometric programming is widely used; many objective functions in optimization problems can be analyzed by geometric programming. We often encounter these in resource allocation and structure optimization and technology management, etc. On the other hand, fuzzy relation equalities and inequalities are also used in many areas. We here present a geometric programming model with a monomial objective function subject to the fuzzy relation inequality constraints with maxproduct composition. Simplification operations have been given to accelerate the resolution of the problem by removing the components having no effect on the solution process. Also, an algorithm and two practical examples are presented to abbreviate and illustrate the steps of the problem resolution