Computational studies of some fuzzy mathematical problems

In modelling and optimizing real world systems and processes, one usually ends up with a linear or nonlinear programming problem, namely maximizing one or more objective functions subject to a set of constraint equations or inequalities. For many cases, the constraints do not need to be satisfied exactly, and the coefficients involved in the model are imprecise in nature and have to be described by fuzzy numbers to reflect the real world nature. The resulting mathematical programming problem is referred to as a fuzzy mathematical programming problem.Over the past decades, a great deal of work has been conducted to study fuzzy mathematical programming problems and a large volume of results have been obtained. However, many issues have not been resolved. This research is thus undertaken to study two types of fuzzy mathematical programming problems. The first type of problems is fuzzy linear programming in which the objective function contains fuzzy numbers. To solve this type of problems, we firstly introduce the concept of fuzzy max order and non-dominated optimal solution to fuzzy mathematical programming problems within the framework of fuzzy mathematics. Then, based on the new concept introduced, various theorems are developed, which involve converting the fuzzy linear programming problem to a four objective linear programming problem of non-fuzzy members. The theoretical results and methods developed are then validated and their applications for solving fuzzy linear problems are demonstrated through examples.The second type of problems which we tackle in this research is fuzzy linear programming in which the constraint equations or inequalities contain fuzzy numbers. For this work, we first introduce a new concept, the α-fuzzy max order. Based on this concept, the general framework of an α-fuzzy max order method is developed for solving fuzzy linear programming problems with fuzzy parameters in the constraints. For the special cases in which the constraints consist of inequalities containing fuzzy numbers with isosceles triangle or trapezoidal membership functions, we prove that the feasible solution space can be determined by the respective 3n or 4n non-fuzzy inequalities. For the general cases in which the constraints contain fuzzy numbers with any other form of membership functions, robust numerical algorithms have been developed for the determination of the feasible solution space and the optimal solution to the fuzzy linear programming problem in which the constraints contain fuzzy parameters. Further, by using the results for both the first and second types of problems, general algorithms have also been developed for the general fuzzy linear programming problems in which both the objective function and the constraint inequalities contain fuzzy numbers with any forms of membership functions. Some examples are then presented to validate the theoretical results and the algorithms developed, and to demonstrate their applications