Abstract
In this paper, under the condition of granular differentiation, we consider the fuzzy optimization problems with the general fuzzy function as the objective function. Firstly, we introduce the concept of granular convexity, and propose the properties of the granular convex fuzzy functions. Secondly, we present the Karush-Kuhn-Tucker type optimality conditions of the fuzzy relative optimal solution of more general fuzzy programming problems and some test examples. Finally, the relationships between a class of variational inequalities and the fuzzy optimization problems are established.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call