Method for solving quasi-concave and non-concave fuzzy multi-objective programming problems

Chian Son Yu*, Han-Lin Li

*此作品的通信作者

研究成果: Article同行評審

8 引文 斯高帕斯(Scopus)

摘要

This paper proposes a method based on linear programming techniques to treat quasi-concave and non-concave fuzzy multi-objective programming (FMOP) problems. The proposed method initially presents a piecewise linear expression to interpreting a quasi-concave membership function. Then we find the convex-type break points and transform all quasi-concave membership functions into concave functions. After that, the converted program is solved by linear programming techniques to obtain a global optimum. In addition to not containing any of the zero-one variables, the proposed method does not require dividing the quasi-concave FMOP problem into large sub-problems as in conventional methods. The extension of the proposed method can treat general non-concave FMOP problems by merely adding less number of zero-one variables.

原文English
頁(從 - 到)205-227
頁數23
期刊Fuzzy Sets and Systems
122
發行號2
DOIs
出版狀態Published - 15 9月 2001

指紋

深入研究「Method for solving quasi-concave and non-concave fuzzy multi-objective programming problems」主題。共同形成了獨特的指紋。

引用此