LP problems constrained with D-FRIs

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.; JAFARPOUR M.

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

Journal Paper

Paper Information

Journal: JOURNAL OF ALGORITHMS AND COMPUTATION Year:2018 | Volume:50 | Issue:2 Page(s): 59-79

Download Full-Text

View:

197

Download:

117

Cites:

Information Journal Paper

Title

LP problems constrained with D-FRIs

Author(s)

GHODOUSIAN A. | JAFARPOUR M. | Issue Writer Certificate

Keywords

Fuzzy relation

fuzzy relational inequality

linear optimization

fuzzy compositions and t-norms

Abstract

In this paper, optimization of a linear objective func-tion with Fuzzy relational inequality constraints is in-vestigated where the feasible region is formed as the in-tersection of two inequality fuzzy systems and Dombi family of t-norms is considered as fuzzy composition. Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increas-ing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms when the param-eter is changed from zero to in nity. The resolution of the feasible region of the problem is rstly investigated when it is de ned with max-Dombi composition. Based on some theoretical results, a necessary and su cient condition and three other necessary conditions are de-rived for determining the feasibility. Moreover, in order to simplify the problem, some procedures are presented.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

GHODOUSIAN, A., & JAFARPOUR, M.. (2018). LP problems constrained with D-FRIs. JOURNAL OF ALGORITHMS AND COMPUTATION, 50(2), 59-79. SID. https://sid.ir/paper/354562/en

Vancouver: Copy

GHODOUSIAN A., JAFARPOUR M.. LP problems constrained with D-FRIs. JOURNAL OF ALGORITHMS AND COMPUTATION[Internet]. 2018;50(2):59-79. Available from: https://sid.ir/paper/354562/en

IEEE: Copy

A. GHODOUSIAN, and M. JAFARPOUR, “LP problems constrained with D-FRIs,” JOURNAL OF ALGORITHMS AND COMPUTATION, vol. 50, no. 2, pp. 59–79, 2018, [Online]. Available: https://sid.ir/paper/354562/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops