in this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. we study this problem and capture some special characteristics of its feasible domain and optimal s...

In this article we will use the redefined definition of a fuzzy subgroup as in [1], and will mainly prove that if G, G are two groups and f: G G' is an epirnorphism, then there is a bijection between the set of all fuzzy subgroups of G/Ker f and that of G .

In this paper, we introduce the concept of an anti M-fuzzy subgroup of an M-group and lower level subset of an anti M-fuzzy subgroup and discussed some of its properties.

recently, gasimov and yenilmez proposed an approach for solving two kinds of fuzzy linear programming (flp) problems. through the approach, each flp problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. then, the crisp problem is solved by the use of the modified subgradient method. in this paper we will have another look at the earlier defuzzifi...

This work considers the resolution of the system of fuzzy integer inequalities. It is shown that a system of fuzzy integer inequalities with concave membership functions can be reduced to a regular convex integer programming problem. A modified solution algorithm of the -th power Lagrangian method is introduced to deal with the resulting convex integer programming problem as a sequence of linea...