Posynomial geometric programming problem subject to max–min fuzzy relation equations
We discuss a class of posynomial geometric programming problem(PGPF), aimed at minimizing a posynomial subject to fuzzy relational equations with max–min composition. By introducing auxiliary variables, we convert the PGPF into an equivalent programming problem whose objective function is a non-decr...
Saved in:
Published in | Information sciences Vol. 328; pp. 15 - 25 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
20.01.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!