Fuzzy Relation Geometric Programming And Its Procedure Realizing

Fuzzy relation geometric programming problems as a new research topic is greatly concerned by the domestic and foreign scholars. In recent years, the fuzzy relation geometric programming has received considerable development in application and theory.However,there are many problems to be solved. For example, we always try to transform fuzzy optimization problems into exactly problems and frequently omit some optimal solution or limit to partial minimal solutions. So it is very necessary to discuss the models and algorithms about fuzzy relation geometric programming.Based on prevenient achievements of the fuzzy relation geometric programming problems,by the numbers and roundly,this paper discusses the models and algorithms of the fuzzy relation geometric programming with more complicated objective function, which is composed by monomial functions and"max-min"composition, subject to the fuzzy relation equation constraints. The main content and conclusions are as follows:1. Narrating the background of geometric programming and fuzzy programming and introducing the development status of the present study on fuzzy relation geometric programming problems.2. Outlining the theory of fuzzy mathematics programming and fuzzy relation equation and give an introduction of several types of fuzzy relation geometric programming model's structure already studied.3. Discussing the optimal solution based on exponent of monomial among objective function, then proposing the theoretical proof.4. Giving some numerical results to prove the algorithm and the procedure to be feasible and effective.5. Finally, presenting this thesis's summary and the direction for further discussion.