A NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS

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.

SAFI M.R.; MALEKI H.R.; ZAEIM AZAD E.

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

Journal Paper

Paper Information

Journal: Iranian Journal of Fuzzy Systems Year:2007 | Volume:4 | Issue:2 Page(s): 31-45

Download Full-Text

Persian Verion

View:

2,031

Download:

373

Cites:

Information Journal Paper

Title

A NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS

Author(s)

SAFI M.R. | MALEKI H.R. | ZAEIM AZAD E. | Issue Writer Certificate

Keywords

LINEAR PROGRAMMINGQ2

FUZZY SET THEORYQ2

FUZZY LINEAR PROGRAMMING AND FUZZY EFFICIENCYQ2

Abstract

There are several methods for solving fuzzy LINEAR PROGRAMMING (FLP) problems. When the constraints and/or the objective function are fuzzy, the methods proposed by Zimmermann, Verdegay, Chanas and Werners are used more often than the others. In the Zimmerman method (ZM) the main objective function cx is added to the constraints as a fuzzy goal and the corresponding LINEAR PROGRAMMING (LP) problem with a new objective (l) is solved. When this new LP has alternative optimal solutions (AOS), ZM may not always present the "best" solution. Two cases may occur: cx may have different bounded values for the AOS or be unbounded. Since all of the AOS have the samel, they have the same values for the new LP. Therefore, unless we check the value of cx for all AOS, it may be that we do not present the best solution to the decision maker (DM); it is possible that cx is unbounded but ZM presents a bounded solution as the optimal solution. In this note, we propose an algorithm for eliminating these difficulties.

Cites

No record.

References

Cite

APA: Copy

SAFI, M.R., MALEKI, H.R., & ZAEIM AZAD, E.. (2007). A NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS. IRANIAN JOURNAL OF FUZZY SYSTEMS, 4(2), 31-45. SID. https://sid.ir/paper/113340/en

Vancouver: Copy

SAFI M.R., MALEKI H.R., ZAEIM AZAD E.. A NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS. IRANIAN JOURNAL OF FUZZY SYSTEMS[Internet]. 2007;4(2):31-45. Available from: https://sid.ir/paper/113340/en

IEEE: Copy

M.R. SAFI, H.R. MALEKI, and E. ZAEIM AZAD, “A NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS,” IRANIAN JOURNAL OF FUZZY SYSTEMS, vol. 4, no. 2, pp. 31–45, 2007, [Online]. Available: https://sid.ir/paper/113340/en

Related Journal Papers