On the resolution and linear optimization problems subject to a system of bipolar fuzzy relational equalities defined with continuous Archimedean t-norms

• Main Authors: Ghodousian, Amin, Chopannavaz, Mohammad Sedigh, Pedrycz, Witold
• Format: Journal Article
• Language: English
• Published: 08.02.2025
• Subjects: Mathematics - Optimization and Control
• DOI: 10.48550/arxiv.2503.05874

This paper considers the linear objective function optimization with respect to a more general class of bipolar fuzzy relational equations, where the fuzzy compositions are defined by an arbitrary continuous Archimedean t-norm. In addition, a faster method for finding a global optimum is proposed that, unlike the previous work, does not require obtaining all local optimal solutions and classifying the constraints. Analytical concepts and properties of the Archimedean bipolar fuzzy equations are investigated and two necessary conditions are presented to conceptualize the feasibility of the problem. It is shown that the feasible solution set can be resulted by a union of the finite number of compact sets, where each compact set is obtained by a function. Moreover, to accelerate identification of the mentioned compact sets (and therefore, to speed up solution finding), four simplification techniques are presented, which are based on either omitting redundant constraints and/or eliminating unknowns by assigning them a fixed value. Also, three additional simplification techniques are given to reduce the search domain by removing some parts of the feasible region that do not contain optimal solutions. Subsequently, a method is proposed to find an optimal solution for the current linear optimization problems. The proposed method consists of two accelerative strategies that are used during the problem solving process. By the first strategy, the method neglects some candidate solutions that are not optimal, by considering only a subset of admissible functions. As for the second strategy, a branch-and-bound method is used to delete non-optimal branches. Then, the method is summarized in an algorithm that represents all essential steps of the solution and finally, the whole method is applied in an example that has been chosen in such a way that the various situations are illustrated.