Methods for solving some types of Fully Fuzzy nonlinear programming problems رسالة ماجستير

Abstract

In this thesis, we used two methods to solve two types of fully fuzzy nonlinear program ming problem. The first method was the ranking function method, which is used to solve some types of fully fuzzy nonlinear programming problem that satisfies Karuch-Kuhn-Tucker (KKT) conditions and separable nonlinear problems. In the first method, the fully fuzzy non linear programming problem is converted to a crisp programming problem by the ranking function. In the second method, the separable programming problem was converted to an interval pro gramming problem. We show how the procedure works in case of having triangular fuzzy number and we generalized the method in case of having trapezoidal and hexagonal fuzzy numbers . each method was explained in details and we have shown numerical examples of each method in case of having triangular, trapezoidal and hexagonal fuzzy numbers. Last we have shown a comparison between the two methods in terms of the number of equations in each method and the complexity level results of the examples that we have got from the two methods and showed how they are close