Mosaheb

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

---

In this article, we study a class of posynomial geometric programming problem (PGPF), with the purpose of minimizing a posynomial subject to fuzzy relational equations with max–product composition. With the help of auxiliary variables, it is converted convert the PGPF into an equivalent programming problem whose objective function is a non-decreasing function with an auxiliary variable. Some preliminary definitions are introduced. Since the feasible solutions are not convex the basic programming techniques are not applicable. It is shown that an optimal solution consists of a maximum feasible solution and finite number of minimal feasible solutions by an equivalent programming problem. In fact, there are a lot minimal solutions and to obtain all them is tedious steps, boring and time consuming. Furthermore, we propose some rules for full simplifying the problem. Then by using a branch and bound approach and fuzzy relational equations (FRE) path, it is presented an algorithm to achieve an optimal solution to the PGPF. Finally, a numerical experiment is given to illustrate the steps of the algorithm.

Keywords: Fuzzy relation inequality, Separable programming, Least square technique, Minimal solution, Max-Product composition, Fuzzy optimization.

Full-Text [PDF 3749 kb]   (383 Downloads)    

Add your comments about this article : Your username or Email:

---

---