Approximating credibilistic constraints by robust counterparts of uncertain linear inequality

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.

Liu N.Q.; CHEN Y.J.; LIU Y.K.

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

Journal Paper

Paper Information

Journal: Iranian Journal of Fuzzy Systems Year:2021 | Volume:18 | Issue:5 Page(s): 37-51

Download Full-Text

Persian Verion

View:

167

Download:

104

Cites:

Information Journal Paper

Title

Approximating credibilistic constraints by robust counterparts of uncertain linear inequality

Author(s)

Liu N.Q. | CHEN Y.J. | LIU Y.K. | Issue Writer Certificate

Keywords

Credibilistic optimizationQ2

credibilistic constraintQ2

ambiguity setQ2

safe approximationQ2

Abstract

This paper studies a class of Credibilistic optimization (CO) problems, in which a convex objective is minimized subject to ambiguous credibilistic constraints. The considered CO problem is usually computational intractable. Our purpose in this paper is to discuss the robust counterpart approximations of ambiguous credibilistic constraints. Under mild assumptions, the closed property about the feasible region of credibilistic constraint is discussed. Using the obtained results, this paper deals with the robust counterpart approximations of credibilistic constraints under two types of ambiguity sets of possibility distributions. The first type is exponential function-based ambiguity set of possibility distribution, while the second type of ambiguity set is a particular case of the first one, and it is based on range and expectation information of fuzzy variables. The developed approximation techniques are capable to utilize the knowledge of ambiguity sets of possibility distributions when building distribution uncertainty-immunized solutions. As a result, the obtained safe approximations of ambiguous credibilistic constraints are computationally tractable convex/linear constraints. To apply the proposed approximation approach, a portfolio optimization problem is addressed, in which the investor is to find a portfolio to maximize the value-at-risk of his total return under the support and expectation information of uncertain returns. We use two types of robust counterpart approximations to credibilistic constraints. The computational results support our arguments.

Cites

No record.

References

No record.

Cite

APA: Copy

Liu, N.Q., CHEN, Y.J., & LIU, Y.K.. (2021). Approximating credibilistic constraints by robust counterparts of uncertain linear inequality. IRANIAN JOURNAL OF FUZZY SYSTEMS, 18(5 ), 37-51. SID. https://sid.ir/paper/413828/en

Vancouver: Copy

Liu N.Q., CHEN Y.J., LIU Y.K.. Approximating credibilistic constraints by robust counterparts of uncertain linear inequality. IRANIAN JOURNAL OF FUZZY SYSTEMS[Internet]. 2021;18(5 ):37-51. Available from: https://sid.ir/paper/413828/en

IEEE: Copy

N.Q. Liu, Y.J. CHEN, and Y.K. LIU, “Approximating credibilistic constraints by robust counterparts of uncertain linear inequality,” IRANIAN JOURNAL OF FUZZY SYSTEMS, vol. 18, no. 5 , pp. 37–51, 2021, [Online]. Available: https://sid.ir/paper/413828/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops