A new algorithm for geometric optimization with a single-term exponent constrained by bipolar fuzzy relation equations

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Aliannezhadi S.; Abbasi Molai A.

Educational Videos and Scientific Workshops

Scientific Information Database

ISSN: 2588-4824

Journal Paper

Paper Information

Journal: Iranian Journal of Fuzzy Systems Year:2021 | Volume:18 | Issue:1 Page(s): 137-150

Download Full-Text

Persian Verion

View:

187

Download:

116

Cites:

Information Journal Paper

Title

A new algorithm for geometric optimization with a single-term exponent constrained by bipolar fuzzy relation equations

Author(s)

Aliannezhadi S. | Abbasi Molai A. | Issue Writer Certificate

Keywords

Bipolar fuzzy relation equationQ2

geometric programmingQ2

max-product compositionQ2

modified branch-and bound methodQ2

Abstract

A geometric programming problem subject to bipolar max-product fuzzy relation equation constraints is studied in this paper. Some necessary and sufficient conditions are given for its solution existence. A lower and upper bound on the solution set of its feasible domain is obtained. Some sufficient conditions are proposed to determine some its optimal components without its resolution. A modified branch-and-bound method is extended to solve the problem. Moreover, an efficient algorithm is proposed to solve the problem based on the simplification operations and the modified branch-and-bound method. Its computational complexity is carefully analyzed. Some examples are given to show the importance of the problem and to illustrate the process of the algorithm. Finally, an analytic and comparative study is done to show the efficiency of the simplification procedures.

Cites

No record.

References

No record.

Cite

APA: Copy

Aliannezhadi, S., & Abbasi Molai, A.. (2021). A new algorithm for geometric optimization with a single-term exponent constrained by bipolar fuzzy relation equations. IRANIAN JOURNAL OF FUZZY SYSTEMS, 18(1 ), 137-150. SID. https://sid.ir/paper/412588/en

Vancouver: Copy

Aliannezhadi S., Abbasi Molai A.. A new algorithm for geometric optimization with a single-term exponent constrained by bipolar fuzzy relation equations. IRANIAN JOURNAL OF FUZZY SYSTEMS[Internet]. 2021;18(1 ):137-150. Available from: https://sid.ir/paper/412588/en

IEEE: Copy

S. Aliannezhadi, and A. Abbasi Molai, “A new algorithm for geometric optimization with a single-term exponent constrained by bipolar fuzzy relation equations,” IRANIAN JOURNAL OF FUZZY SYSTEMS, vol. 18, no. 1 , pp. 137–150, 2021, [Online]. Available: https://sid.ir/paper/412588/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops

Download

Move to top

وبگردی