Duality theory in fuzzy mathematical programming problems with fuzzy coefficients

AbstractIn this paper, the notions of subgradient, subdifferential, and differential with respect to convex fuzzy mappings are investigated, which provides the basis for the fuzzy extremum problem theory. We consider the problems of minimizing or maximizing a convex fuzzy mapping over a convex set and develop the necessary and/or sufficient optimality conditions. Furthermore, the concept of saddle-points and minimax theorems under fuzzy environment is discussed. The results obtained are used to formulate the Lagrangian dual of fuzzy programming. Under certain fuzzy convexity assumptions, KKT conditions for fuzzy programming are derived, and the “perturbed” convex fuzzy programming is considered. Finally, these results are applied to fuzzy linear programming and fuzzy quadratic programming