شماره ركورد كنفرانس :
4781
عنوان مقاله :
The geometric programming problem provided to fuzzy relation inequality constraints
پديدآورندگان :
Hedayatfar Behnaz School of Mathematics and Computer Sciences, Damghan University, P.O.Box 36715-364, Damghan, Iran , Abbasi Molai Ali School of Mathematics and Computer Sciences, Damghan University, P.O.Box 36715-364, Damghan, Iran
كليدواژه :
Fuzzy relation inequality , geometric programming , max , product composition , minimal solution.
عنوان كنفرانس :
يازدهمين كنفرانس بين المللي انجمن ايراني تحقيق در عمليات
چكيده فارسي :
In this paper, the geometric programming problem subject to Fuzzy Relation Inequality (FRI) constraints is considered. We firstly study the structure of its feasible domain. The feasible solution set is completely determined by a maximum solution and a finite number of minimal or quasi-minimal solutions. Then the problem is converted to two sub-problems. The maximum solution and one of the minimal solutions solve two sub-problems. Combining two solutions, we can find the optimal solution of the original problem.
