Optimizing linear functions over novel fuzzy relation equations: Structure, feasibility, and global solutions

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.

Ghodousian A.; Mollakazemiha M.; Mashinchi M.; Mesiar R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Iranian Journal of Fuzzy Systems Year:2025 | Volume:10 | Issue:3 Page(s): 151-179

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Optimizing linear functions over novel fuzzy relation equations: Structure, feasibility, and global solutions

Author(s)

Ghodousian A. | Mollakazemiha M. | Mashinchi M. | Mesiar R. | Issue Writer Certificate

Keywords

linear optimization

Fuzzy relational equations

minimal vertex covering

Abstract

We investigate the linear objective function optimization problem constrained by a new system of fuzzy relationequations, utilizing the minimum t-norm for fuzzy compositions. Our findings reveal that the feasible region ischaracterized as a finite union of closed convex cells. We provide necessary and sufficient conditions to determinethe problem’s feasibility. To streamline optimization, seven novel rules are proposed, on which an algorithm is basedto achieve a global optimum. Notably, a specific instance of our problem is shown to be equivalent to the well-knownminimal vertex cover problem. The efficacy of our algorithm is demonstrated through a concrete example.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans